./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c10d45b5c95e322c3a9476f6a89ce233987fcc3d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:34,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:34,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:34,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:34,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:34,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:34,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:34,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:34,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:34,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:34,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:34,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:34,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:34,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:34,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:34,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:34,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:34,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:34,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:34,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:34,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:34,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:34,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:34,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:34,607 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:34,608 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:34,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:34,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:34,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:34,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:34,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:34,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:34,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:34,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:34,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:34,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:34,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:34,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:34,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:34,654 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:34,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:34,655 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:34,656 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:34,657 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:34,657 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:34,657 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:34,658 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:34,658 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:34,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:34,658 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:34,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:34,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:34,659 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:34,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:34,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:34,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:34,663 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:34,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:34,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:34,664 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:34,665 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:34,668 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-11-28 23:21:34,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:34,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:34,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:34,749 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:34,749 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:34,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-28 23:21:34,813 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a197207e/eac4dca1a69c43fa8d7db25f85ad6961/FLAGd2efb534a [2018-11-28 23:21:35,366 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:35,367 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-28 23:21:35,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a197207e/eac4dca1a69c43fa8d7db25f85ad6961/FLAGd2efb534a [2018-11-28 23:21:35,641 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a197207e/eac4dca1a69c43fa8d7db25f85ad6961 [2018-11-28 23:21:35,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:35,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:35,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:35,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:35,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:35,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:35" (1/1) ... [2018-11-28 23:21:35,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613db22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:35, skipping insertion in model container [2018-11-28 23:21:35,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:35" (1/1) ... [2018-11-28 23:21:35,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:35,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:36,119 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:36,137 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:36,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:36,360 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:36,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36 WrapperNode [2018-11-28 23:21:36,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:36,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:36,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:36,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:36,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:36,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:36,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:36,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:36,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... [2018-11-28 23:21:36,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:36,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:36,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:36,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:36,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:21:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:36,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:36,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:36,973 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:36,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:36 BoogieIcfgContainer [2018-11-28 23:21:36,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:36,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:36,974 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:36,979 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:36,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:36,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:35" (1/3) ... [2018-11-28 23:21:36,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40828248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:36, skipping insertion in model container [2018-11-28 23:21:36,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:36,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:36" (2/3) ... [2018-11-28 23:21:36,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40828248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:36, skipping insertion in model container [2018-11-28 23:21:36,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:36,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:36" (3/3) ... [2018-11-28 23:21:36,986 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-28 23:21:37,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:37,047 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:37,047 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:37,048 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:37,048 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:37,048 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:37,048 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:37,048 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:37,048 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:37,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:21:37,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:21:37,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:37,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:37,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:37,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:37,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:37,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:21:37,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:21:37,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:37,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:37,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:37,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:37,107 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true assume !(main_~length2~0 < 1); 6#L565-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; 16#L553-4true [2018-11-28 23:21:37,107 INFO L796 eck$LassoCheckResult]: Loop: 16#L553-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; 11#L552-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 13#L553-3true assume !true; 16#L553-4true [2018-11-28 23:21:37,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:21:37,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-11-28 23:21:37,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:37,325 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-28 23:21:37,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:37,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 23:21:37,332 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:21:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:21:37,352 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 23:21:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:37,363 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 23:21:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:21:37,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 23:21:37,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:21:37,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-28 23:21:37,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:37,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:37,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:21:37,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:37,374 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:21:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:21:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:21:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:21:37,399 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:37,399 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:37,399 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:37,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:21:37,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:21:37,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:37,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:37,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:37,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:37,401 INFO L794 eck$LassoCheckResult]: Stem: 42#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#L562 assume !(main_~length1~0 < 1); 45#L562-2 assume !(main_~length2~0 < 1); 40#L565-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; 41#L553-4 [2018-11-28 23:21:37,401 INFO L796 eck$LassoCheckResult]: Loop: 41#L553-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; 46#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L553-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; 43#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 41#L553-4 [2018-11-28 23:21:37,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 23:21:37,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-11-28 23:21:37,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-11-28 23:21:37,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,957 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 23:21:38,096 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:21:38,759 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-28 23:21:39,071 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:21:39,085 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:39,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:39,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:39,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:39,087 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:39,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:39,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:39,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:39,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:39,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:39,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:39,120 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-28 23:21:39,540 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-28 23:21:39,764 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-28 23:21:39,765 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-28 23:21:39,770 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-28 23:21:39,773 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-28 23:21:39,775 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-28 23:21:39,778 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-28 23:21:39,780 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-28 23:21:39,796 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-28 23:21:39,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,804 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-28 23:21:39,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,851 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-28 23:21:39,853 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-28 23:21:39,859 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-28 23:21:39,861 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-28 23:21:40,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:40,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:40,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,537 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:40,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,542 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:40,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,579 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:40,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,584 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:40,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:40,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:21:40,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,619 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:21:40,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:40,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:40,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,725 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:40,790 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:21:40,791 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:21:40,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:40,797 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:40,797 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:40,798 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-28 23:21:40,923 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:21:40,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:40,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:41,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:41,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:41,140 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-28 23:21:41,145 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-28 23:21:41,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:21:41,278 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-28 23:21:41,281 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-28 23:21:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:21:41,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:21:41,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:21:41,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:21:41,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 23:21:41,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:41,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-11-28 23:21:41,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:21:41,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:41,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:21:41,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:41,293 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:21:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:21:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-28 23:21:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:21:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-28 23:21:41,295 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:21:41,295 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:21:41,296 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:41,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-28 23:21:41,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:41,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:41,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:41,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:41,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:41,297 INFO L794 eck$LassoCheckResult]: Stem: 156#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#L562 assume !(main_~length1~0 < 1); 162#L562-2 assume !(main_~length2~0 < 1); 154#L565-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; 155#L553-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; 163#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 165#L553-3 [2018-11-28 23:21:41,298 INFO L796 eck$LassoCheckResult]: Loop: 165#L553-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; 157#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 158#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 165#L553-3 [2018-11-28 23:21:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-28 23:21:41,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-11-28 23:21:41,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-11-28 23:21:41,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:41,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:41,722 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:21:42,345 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2018-11-28 23:21:42,486 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 23:21:42,490 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:42,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:42,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:42,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:42,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:42,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:42,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:42,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:42,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:21:42,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:42,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:42,498 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-28 23:21:42,506 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-28 23:21:42,507 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-28 23:21:42,510 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-28 23:21:42,513 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-28 23:21:42,516 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-28 23:21:42,524 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-28 23:21:42,526 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-28 23:21:42,527 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-28 23:21:42,529 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-28 23:21:42,532 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-28 23:21:42,535 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-28 23:21:42,542 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-28 23:21:42,887 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-28 23:21:43,010 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-28 23:21:43,013 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-28 23:21:43,016 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-28 23:21:43,018 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-28 23:21:43,021 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-28 23:21:43,026 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-28 23:21:43,653 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:43,653 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:43,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:43,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:43,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:43,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,732 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:43,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:43,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:43,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:43,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:21:43,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:43,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:43,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:43,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:43,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:43,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:43,812 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:43,828 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:43,828 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:21:43,828 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:43,830 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:43,831 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:43,831 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-28 23:21:44,169 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 23:21:44,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:44,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:44,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:44,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:45,202 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-28 23:21:45,203 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-28 23:21:45,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 23:21:45,367 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-28 23:21:45,369 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-28 23:21:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:21:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:21:45,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:21:45,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:45,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:21:45,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:45,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:21:45,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:45,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-28 23:21:45,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:45,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-11-28 23:21:45,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:21:45,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:21:45,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-28 23:21:45,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:45,380 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 23:21:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-28 23:21:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-11-28 23:21:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:21:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:21:45,382 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:21:45,382 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:21:45,382 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:21:45,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 23:21:45,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:45,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:45,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:45,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:45,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:45,384 INFO L794 eck$LassoCheckResult]: Stem: 312#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#L562 assume !(main_~length1~0 < 1); 318#L562-2 assume !(main_~length2~0 < 1); 310#L565-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; 311#L553-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; 319#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 320#L553-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; 315#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 316#L553-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; 322#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 321#L553-3 [2018-11-28 23:21:45,385 INFO L796 eck$LassoCheckResult]: Loop: 321#L553-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; 313#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 314#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 321#L553-3 [2018-11-28 23:21:45,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-11-28 23:21:45,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:45,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-11-28 23:21:45,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:45,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:45,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-11-28 23:21:45,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:45,661 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-28 23:21:45,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:21:45,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:21:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:45,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:45,745 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-28 23:21:45,752 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-28 23:21:45,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:21:45,804 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-28 23:21:45,827 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-28 23:21:45,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:21:45,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:21:45,968 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-28 23:21:45,974 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-28 23:21:45,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-28 23:21:54,355 WARN L180 SmtUtils]: Spent 3.58 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:21:57,268 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:21:57,274 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-28 23:21:57,281 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-28 23:21:57,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:21:57,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:21:57,289 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-28 23:21:57,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-28 23:21:57,291 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-28 23:21:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:21:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-28 23:21:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:21:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-11-28 23:21:57,395 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-28 23:22:00,807 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-28 23:22:04,156 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-28 23:22:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:04,410 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-28 23:22:04,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:22:04,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-28 23:22:04,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:04,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-11-28 23:22:04,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:22:04,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:22:04,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-28 23:22:04,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:04,414 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 23:22:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-28 23:22:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-28 23:22:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:22:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-28 23:22:04,421 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 23:22:04,421 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 23:22:04,421 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:22:04,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-28 23:22:04,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:04,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:04,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:04,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:04,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:22:04,423 INFO L794 eck$LassoCheckResult]: Stem: 423#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#L562 assume !(main_~length1~0 < 1); 428#L562-2 assume !(main_~length2~0 < 1); 421#L565-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; 422#L553-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; 429#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 430#L553-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; 426#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 427#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 434#L553-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#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 432#L553-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; 433#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 431#L553-3 [2018-11-28 23:22:04,424 INFO L796 eck$LassoCheckResult]: Loop: 431#L553-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; 424#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 425#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 431#L553-3 [2018-11-28 23:22:04,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-11-28 23:22:04,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:04,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:04,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:04,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-11-28 23:22:04,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-11-28 23:22:04,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:04,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:04,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:04,756 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:22:05,590 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 160 [2018-11-28 23:22:05,779 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-28 23:22:05,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:05,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:05,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:05,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:05,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:05,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:05,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:05,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:05,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:22:05,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:05,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:05,789 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-28 23:22:05,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,852 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-28 23:22:05,854 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-28 23:22:05,858 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-28 23:22:05,861 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-28 23:22:05,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-28 23:22:05,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-28 23:22:05,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-28 23:22:05,877 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-28 23:22:05,882 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-28 23:22:05,900 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-28 23:22:05,902 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-28 23:22:05,905 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-28 23:22:05,906 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-28 23:22:06,598 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-28 23:22:06,742 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-28 23:22:06,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,750 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-28 23:22:06,752 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-28 23:22:06,754 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-28 23:22:07,070 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 23:22:07,437 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:22:08,286 WARN L180 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-28 23:22:08,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:08,402 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:08,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:08,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:08,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:08,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:08,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,438 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:08,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,439 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:08,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:08,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 23:22:08,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:08,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:08,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:08,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:08,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:08,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:08,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:08,587 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:22:08,587 INFO L444 ModelExtractionUtils]: 43 out of 52 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:22:08,588 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:08,590 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:08,590 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:08,590 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-28 23:22:08,824 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-28 23:22:08,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:22:08,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:08,903 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-28 23:22:08,904 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-28 23:22:08,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:22:08,963 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-28 23:22:08,964 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-28 23:22:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-28 23:22:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:08,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:08,965 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:08,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:09,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:09,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:09,047 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-28 23:22:09,047 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-28 23:22:09,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:22:09,156 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-28 23:22:09,157 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-28 23:22:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:22:09,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:09,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:09,158 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:09,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:09,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:09,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:09,242 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-28 23:22:09,243 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-28 23:22:09,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:22:09,281 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-28 23:22:09,283 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-28 23:22:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-28 23:22:09,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:09,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:09,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:22:09,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:09,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:22:09,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:09,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-28 23:22:09,293 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:09,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-28 23:22:09,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:22:09,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:22:09,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:22:09,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:09,293 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,293 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,293 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,294 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:22:09,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:22:09,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:09,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:22:09,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:09 BoogieIcfgContainer [2018-11-28 23:22:09,303 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:09,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:09,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:09,304 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:09,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:36" (3/4) ... [2018-11-28 23:22:09,310 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:22:09,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:09,313 INFO L168 Benchmark]: Toolchain (without parser) took 33666.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,316 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:09,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.68 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-28 23:22:09,318 INFO L168 Benchmark]: Boogie Preprocessor took 56.35 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-28 23:22:09,318 INFO L168 Benchmark]: RCFGBuilder took 489.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,323 INFO L168 Benchmark]: BuchiAutomizer took 32329.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,324 INFO L168 Benchmark]: Witness Printer took 7.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:09,329 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.68 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. * Boogie Preprocessor took 56.35 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 489.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32329.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 32.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 23.0s. Construction of modules took 0.3s. Büchi inclusion checks took 8.6s. 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.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf99 lsp89 ukn80 mio100 lsp43 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf226 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms 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...