./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eec7850a55859668859d25c9503478e74955da1a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:19:20,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:19:20,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:19:20,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:19:20,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:19:20,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:19:20,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:19:20,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:19:20,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:19:20,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:19:20,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:19:20,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:19:20,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:19:20,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:19:20,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:19:20,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:19:20,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:19:20,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:19:20,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:19:20,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:19:20,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:19:20,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:19:20,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:19:20,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:19:20,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:19:20,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:19:20,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:19:20,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:19:20,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:19:20,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:19:20,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:19:20,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:19:20,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:19:20,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:19:20,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:19:20,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:19:20,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 20:19:20,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:19:20,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:19:20,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:19:20,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:19:20,666 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:19:20,666 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 20:19:20,666 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 20:19:20,666 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 20:19:20,666 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 20:19:20,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 20:19:20,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 20:19:20,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 20:19:20,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:19:20,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:19:20,669 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 20:19:20,669 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 20:19:20,669 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec7850a55859668859d25c9503478e74955da1a [2018-12-02 20:19:20,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:19:20,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:19:20,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:19:20,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:19:20,705 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:19:20,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-12-02 20:19:20,750 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/data/d62ad6813/9b1fc343a45c4b24b4224eea6e009d0e/FLAG50d12ed26 [2018-12-02 20:19:21,159 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:19:21,159 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-12-02 20:19:21,163 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/data/d62ad6813/9b1fc343a45c4b24b4224eea6e009d0e/FLAG50d12ed26 [2018-12-02 20:19:21,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/data/d62ad6813/9b1fc343a45c4b24b4224eea6e009d0e [2018-12-02 20:19:21,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:19:21,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:19:21,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:19:21,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:19:21,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:19:21,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6c5811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21, skipping insertion in model container [2018-12-02 20:19:21,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:19:21,198 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:19:21,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:19:21,295 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:19:21,306 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:19:21,314 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:19:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21 WrapperNode [2018-12-02 20:19:21,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:19:21,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:19:21,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:19:21,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:19:21,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:19:21,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:19:21,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:19:21,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:19:21,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... [2018-12-02 20:19:21,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:19:21,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:19:21,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:19:21,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:19:21,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50d31ed1-3f51-4ad4-ac2f-1de1c553367c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:19:21,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:19:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:19:21,533 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:19:21,533 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-02 20:19:21,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:19:21 BoogieIcfgContainer [2018-12-02 20:19:21,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:19:21,534 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 20:19:21,534 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 20:19:21,536 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 20:19:21,536 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:19:21,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:19:21" (1/3) ... [2018-12-02 20:19:21,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d46b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:19:21, skipping insertion in model container [2018-12-02 20:19:21,537 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:19:21,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:19:21" (2/3) ... [2018-12-02 20:19:21,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d46b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:19:21, skipping insertion in model container [2018-12-02 20:19:21,537 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:19:21,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:19:21" (3/3) ... [2018-12-02 20:19:21,538 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2018-12-02 20:19:21,573 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:19:21,574 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 20:19:21,574 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 20:19:21,574 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 20:19:21,574 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:19:21,574 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:19:21,574 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 20:19:21,574 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:19:21,574 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 20:19:21,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-02 20:19:21,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 20:19:21,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:21,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:21,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,604 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 20:19:21,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-02 20:19:21,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 20:19:21,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:21,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:21,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,611 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L31-4true [2018-12-02 20:19:21,612 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 23#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-4true [2018-12-02 20:19:21,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-12-02 20:19:21,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-12-02 20:19:21,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:21,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:19:21,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:19:21,735 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 20:19:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 20:19:21,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 20:19:21,745 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-12-02 20:19:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:19:21,749 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-02 20:19:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 20:19:21,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-12-02 20:19:21,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 20:19:21,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-12-02 20:19:21,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 20:19:21,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 20:19:21,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-02 20:19:21,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:19:21,756 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 20:19:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-02 20:19:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 20:19:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 20:19:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-02 20:19:21,775 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 20:19:21,775 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 20:19:21,775 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 20:19:21,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-02 20:19:21,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 20:19:21,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:21,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:21,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:21,777 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 50#L31-4 [2018-12-02 20:19:21,777 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 57#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 61#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 52#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 50#L31-4 [2018-12-02 20:19:21,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-12-02 20:19:21,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:21,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:21,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:21,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-12-02 20:19:21,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:21,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:21,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:19:21,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:21,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-12-02 20:19:21,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:21,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:21,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:19:21,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:19:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:19:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:19:22,155 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-12-02 20:19:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:19:22,265 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-02 20:19:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:19:22,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-12-02 20:19:22,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 20:19:22,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 20:19:22,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-02 20:19:22,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-02 20:19:22,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-12-02 20:19:22,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:19:22,269 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 20:19:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-12-02 20:19:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-02 20:19:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 20:19:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 20:19:22,271 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 20:19:22,271 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 20:19:22,271 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 20:19:22,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 20:19:22,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 20:19:22,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:22,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:22,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:22,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:22,273 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 142#L31-4 [2018-12-02 20:19:22,274 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 124#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 125#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 138#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 139#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 144#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 143#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 142#L31-4 [2018-12-02 20:19:22,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-12-02 20:19:22,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2018-12-02 20:19:22,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:22,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2018-12-02 20:19:22,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:19:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:22,526 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-02 20:19:22,711 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-12-02 20:19:22,782 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:19:22,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:19:22,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:19:22,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:19:22,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:19:22,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:19:22,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:19:22,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:19:22,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-12-02 20:19:22,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:19:22,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:19:22,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-12-02 20:19:22,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,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-12-02 20:19:22,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:22,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:23,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:19:23,335 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:19:23,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,361 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 20:19:23,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,364 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 20:19:23,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:23,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:23,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:23,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,406 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 20:19:23,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,408 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 20:19:23,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:23,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:23,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:23,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:23,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:23,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:23,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:23,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:23,430 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:19:23,449 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 20:19:23,449 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 20:19:23,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:19:23,451 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:19:23,451 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:19:23,452 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-12-02 20:19:23,474 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-12-02 20:19:23,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 20:19:23,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:23,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:23,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:23,541 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-12-02 20:19:23,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 20:19:23,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-12-02 20:19:23,579 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-12-02 20:19:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 20:19:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-02 20:19:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-02 20:19:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-02 20:19:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-12-02 20:19:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:23,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-02 20:19:23,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:23,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-12-02 20:19:23,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 20:19:23,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 20:19:23,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-02 20:19:23,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:19:23,585 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 20:19:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-02 20:19:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 20:19:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 20:19:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-02 20:19:23,587 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 20:19:23,587 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 20:19:23,587 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 20:19:23,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-02 20:19:23,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:23,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:23,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:23,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:23,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 20:19:23,588 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 290#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 298#L34-5 [2018-12-02 20:19:23,588 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 299#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 305#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 298#L34-5 [2018-12-02 20:19:23,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-12-02 20:19:23,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:23,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-12-02 20:19:23,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:23,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-12-02 20:19:23,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:23,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:23,934 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-12-02 20:19:24,007 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:19:24,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:19:24,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:19:24,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:19:24,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:19:24,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:19:24,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:19:24,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:19:24,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-12-02 20:19:24,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:19:24,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:19:24,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-12-02 20:19:24,162 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-02 20:19:24,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:24,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:19:24,608 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:19:24,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:24,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:24,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:24,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:24,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:24,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:24,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:24,619 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:19:24,623 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 20:19:24,623 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 20:19:24,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:19:24,624 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:19:24,624 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:19:24,624 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 Supporting invariants [] [2018-12-02 20:19:24,641 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 20:19:24,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 20:19:24,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:24,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:24,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:24,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-02 20:19:24,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-02 20:19:24,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-12-02 20:19:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 20:19:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:19:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-02 20:19:24,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 20:19:24,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:24,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-02 20:19:24,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:24,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 20:19:24,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:24,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-12-02 20:19:24,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:24,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-12-02 20:19:24,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 20:19:24,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 20:19:24,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-02 20:19:24,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:19:24,741 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 20:19:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-02 20:19:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-12-02 20:19:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 20:19:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-02 20:19:24,743 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-02 20:19:24,743 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-02 20:19:24,743 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 20:19:24,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-02 20:19:24,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:24,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:24,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:24,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:24,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 20:19:24,745 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 489#L14 assume !(build_nondet_String_~length~0 < 1); 491#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 483#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 485#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 477#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 469#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 470#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 480#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 482#L34-1 assume !cstrpbrk_#t~short7; 487#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 475#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 476#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 474#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 471#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 473#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 478#L34-5 [2018-12-02 20:19:24,745 INFO L796 eck$LassoCheckResult]: Loop: 478#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 479#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 486#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 478#L34-5 [2018-12-02 20:19:24,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2018-12-02 20:19:24,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:24,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:19:24,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:19:24,774 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 20:19:24,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-12-02 20:19:24,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:24,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:19:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:19:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:19:24,876 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 20:19:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:19:24,921 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-02 20:19:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:19:24,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-02 20:19:24,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:24,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-12-02 20:19:24,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 20:19:24,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 20:19:24,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-12-02 20:19:24,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:19:24,923 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 20:19:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-12-02 20:19:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 20:19:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 20:19:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 20:19:24,925 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 20:19:24,925 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 20:19:24,925 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 20:19:24,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 20:19:24,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 20:19:24,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:19:24,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:19:24,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:19:24,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 20:19:24,926 INFO L794 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 563#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 564#L14 assume !(build_nondet_String_~length~0 < 1); 568#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 557#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 558#L14-3 assume !(build_nondet_String_~length~0 < 1); 559#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 552#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 544#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 545#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 562#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 566#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 567#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 549#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 550#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 551#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 546#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 548#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 553#L34-5 [2018-12-02 20:19:24,926 INFO L796 eck$LassoCheckResult]: Loop: 553#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 554#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 560#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 553#L34-5 [2018-12-02 20:19:24,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2018-12-02 20:19:24,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:24,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:19:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-12-02 20:19:24,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:19:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-12-02 20:19:24,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:19:24,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:19:24,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:19:24,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:19:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:19:25,467 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 153 [2018-12-02 20:19:26,339 WARN L180 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2018-12-02 20:19:26,340 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:19:26,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:19:26,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:19:26,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:19:26,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:19:26,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:19:26,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:19:26,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:19:26,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-12-02 20:19:26,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:19:26,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:19:26,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 20:19:26,812 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-12-02 20:19:26,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,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-12-02 20:19:26,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,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-12-02 20:19:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:26,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:19:27,316 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-12-02 20:19:27,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:19:27,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:19:27,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:27,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,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-12-02 20:19:27,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:27,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,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-12-02 20:19:27,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,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-12-02 20:19:27,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:27,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:27,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:27,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,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-12-02 20:19:27,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:19:27,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:19:27,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:19:27,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:27,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:27,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:27,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:19:27,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 20:19:27,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:19:27,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:19:27,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:19:27,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:19:27,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:19:27,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:19:27,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:19:27,459 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 20:19:27,459 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 20:19:27,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:19:27,460 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:19:27,460 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:19:27,461 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2018-12-02 20:19:27,499 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 20:19:27,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 20:19:27,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:27,552 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-02 20:19:27,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-02 20:19:27,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-12-02 20:19:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 20:19:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:19:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 20:19:27,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 20:19:27,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:27,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 20:19:27,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:27,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-02 20:19:27,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-02 20:19:27,681 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-12-02 20:19:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 20:19:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:19:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 20:19:27,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 20:19:27,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:27,682 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 20:19:27,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:19:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:19:27,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:19:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:19:27,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-02 20:19:27,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-02 20:19:27,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-12-02 20:19:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 20:19:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:19:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-02 20:19:27,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 20:19:27,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:27,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2018-12-02 20:19:27,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:27,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2018-12-02 20:19:27,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:19:27,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-12-02 20:19:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:19:27,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-12-02 20:19:27,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 20:19:27,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 20:19:27,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 20:19:27,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:19:27,773 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:19:27,773 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:19:27,773 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:19:27,773 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 20:19:27,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:19:27,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:19:27,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 20:19:27,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:19:27 BoogieIcfgContainer [2018-12-02 20:19:27,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 20:19:27,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:19:27,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:19:27,778 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:19:27,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:19:21" (3/4) ... [2018-12-02 20:19:27,780 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 20:19:27,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:19:27,781 INFO L168 Benchmark]: Toolchain (without parser) took 6607.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -346.7 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,782 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:19:27,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.93 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,783 INFO L168 Benchmark]: Boogie Preprocessor took 46.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,783 INFO L168 Benchmark]: RCFGBuilder took 149.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,784 INFO L168 Benchmark]: BuchiAutomizer took 6243.75 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:19:27,784 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:19:27,786 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.93 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 149.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6243.75 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 148 SDslu, 143 SDs, 0 SdLazy, 205 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn68 mio100 lsp31 div141 bol100 ite100 ukn100 eq163 hnf74 smp91 dnf738 smp23 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 4 VariablesLoop: 3 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...