./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/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_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/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-5842f4b [2018-11-18 15:21:03,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:21:03,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:21:03,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:21:03,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:21:03,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:21:03,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:21:03,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:21:03,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:21:03,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:21:03,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:21:03,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:21:03,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:21:03,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:21:03,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:21:03,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:21:03,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:21:03,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:21:03,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:21:03,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:21:03,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:21:03,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:21:03,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:21:03,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:21:03,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:21:03,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:21:03,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:21:03,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:21:03,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:21:03,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:21:03,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:21:03,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:21:03,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:21:03,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:21:03,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:21:03,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:21:03,488 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:21:03,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:21:03,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:21:03,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:21:03,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:21:03,498 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:21:03,498 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:21:03,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:21:03,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:21:03,500 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:21:03,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:21:03,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:21:03,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:21:03,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:21:03,503 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:21:03,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:21:03,503 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:21:03,503 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:21:03,504 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:21:03,504 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_72b0d60a-8a0f-4873-9aba-353c5d2a6575/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-11-18 15:21:03,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:21:03,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:21:03,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:21:03,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:21:03,541 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:21:03,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-18 15:21:03,584 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/data/0fa667482/977c7b1f335847a7b026487ab182dd9f/FLAG7c3b663dd [2018-11-18 15:21:03,995 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:21:03,995 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-18 15:21:03,999 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/data/0fa667482/977c7b1f335847a7b026487ab182dd9f/FLAG7c3b663dd [2018-11-18 15:21:04,010 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/data/0fa667482/977c7b1f335847a7b026487ab182dd9f [2018-11-18 15:21:04,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:21:04,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:21:04,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:21:04,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:21:04,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:21:04,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263ee91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04, skipping insertion in model container [2018-11-18 15:21:04,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:21:04,036 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:21:04,143 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:21:04,149 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:21:04,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:21:04,169 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:21:04,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04 WrapperNode [2018-11-18 15:21:04,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:21:04,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:21:04,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:21:04,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:21:04,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:21:04,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:21:04,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:21:04,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:21:04,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... [2018-11-18 15:21:04,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:21:04,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:21:04,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:21:04,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:21:04,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72b0d60a-8a0f-4873-9aba-353c5d2a6575/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:21:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:21:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:21:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:21:04,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:21:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:21:04,431 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:21:04,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:21:04 BoogieIcfgContainer [2018-11-18 15:21:04,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:21:04,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:21:04,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:21:04,434 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:21:04,434 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:21:04,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:21:04" (1/3) ... [2018-11-18 15:21:04,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c7b9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:21:04, skipping insertion in model container [2018-11-18 15:21:04,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:21:04,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:21:04" (2/3) ... [2018-11-18 15:21:04,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c7b9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:21:04, skipping insertion in model container [2018-11-18 15:21:04,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:21:04,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:21:04" (3/3) ... [2018-11-18 15:21:04,437 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2018-11-18 15:21:04,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:21:04,477 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:21:04,477 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:21:04,477 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:21:04,477 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:21:04,477 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:21:04,477 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:21:04,477 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:21:04,477 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:21:04,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 15:21:04,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:21:04,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:04,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:04,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,509 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:21:04,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 15:21:04,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:21:04,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:04,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:04,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,516 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 23#L14true assume !(build_nondet_String_~length~0 < 1); 19#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;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 17#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 13#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; 9#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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-11-18 15:21:04,517 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true assume true;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; 6#L34-6true assume !true; 5#L34-7true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 24#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 7#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-11-18 15:21:04,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-18 15:21:04,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:04,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:04,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1602865194, now seen corresponding path program 1 times [2018-11-18 15:21:04,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:04,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:04,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:21:04,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:21:04,647 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:21:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:21:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:21:04,657 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-18 15:21:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:21:04,661 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2018-11-18 15:21:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:21:04,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-18 15:21:04,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:21:04,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 21 transitions. [2018-11-18 15:21:04,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 15:21:04,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 15:21:04,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-18 15:21:04,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:21:04,669 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 15:21:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-18 15:21:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 15:21:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 15:21:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 15:21:04,689 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 15:21:04,689 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 15:21:04,689 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:21:04,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 15:21:04,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:21:04,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:04,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:04,690 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:04,691 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 65#L14 assume !(build_nondet_String_~length~0 < 1); 68#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; 60#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 61#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 63#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; 59#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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; 52#L31-4 [2018-11-18 15:21:04,691 INFO L796 eck$LassoCheckResult]: Loop: 52#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 53#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-6 assume true; 57#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 66#L34-2 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); 62#L34-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 54#L34-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 55#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 58#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; 52#L31-4 [2018-11-18 15:21:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-18 15:21:04,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1362530394, now seen corresponding path program 1 times [2018-11-18 15:21:04,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:04,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:21:04,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:04,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -517253763, now seen corresponding path program 1 times [2018-11-18 15:21:04,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:04,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:21:04,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:21:05,058 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-18 15:21:05,205 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 15:21:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:21:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:21:05,206 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-18 15:21:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:21:05,344 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-18 15:21:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:21:05,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-18 15:21:05,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 15:21:05,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 15:21:05,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 15:21:05,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 15:21:05,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-18 15:21:05,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:21:05,348 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 15:21:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-18 15:21:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-18 15:21:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:21:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-18 15:21:05,351 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 15:21:05,351 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 15:21:05,351 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:21:05,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-18 15:21:05,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 15:21:05,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:05,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:05,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:05,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:05,352 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 138#L14 assume !(build_nondet_String_~length~0 < 1); 143#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; 131#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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-3 assume !(build_nondet_String_~length~0 < 1); 135#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; 136#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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; 149#L31-4 [2018-11-18 15:21:05,352 INFO L796 eck$LassoCheckResult]: Loop: 149#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 133#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; 127#L34-6 assume true; 128#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 142#L34-2 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); 144#L34-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 145#L34-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 151#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 150#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; 149#L31-4 [2018-11-18 15:21:05,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-18 15:21:05,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1362530394, now seen corresponding path program 2 times [2018-11-18 15:21:05,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:05,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -259088325, now seen corresponding path program 1 times [2018-11-18 15:21:05,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:05,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:21:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:05,641 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 15:21:05,829 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-18 15:21:05,915 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:21:05,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:21:05,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:21:05,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:21:05,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:21:05,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:21:05,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:21:05,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:21:05,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-18 15:21:05,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:21:05,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:21:05,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:05,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:05,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:05,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:05,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:05,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,121 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-18 15:21:06,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,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-11-18 15:21:06,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,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-11-18 15:21:06,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-11-18 15:21:06,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-11-18 15:21:06,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-11-18 15:21:06,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:06,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-11-18 15:21:06,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:21:06,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:21:06,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:06,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:06,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:06,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:06,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:06,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:06,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:06,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:06,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:06,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:06,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:06,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:06,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:06,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,534 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:21:06,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,537 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:21:06,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:06,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:06,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:06,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:06,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:06,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:06,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:06,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:06,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:06,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:06,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:06,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:21:06,596 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:21:06,596 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 15:21:06,598 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:21:06,599 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:21:06,599 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:21:06,599 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-11-18 15:21:06,620 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 15:21:06,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:21:06,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:06,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:06,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:06,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:21:06,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 15:21:06,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 48 states and 56 transitions. Complement of second has 4 states. [2018-11-18 15:21:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 15:21:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 15:21:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-18 15:21:06,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-18 15:21:06,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:06,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-18 15:21:06,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:06,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-18 15:21:06,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:06,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-18 15:21:06,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:06,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 24 states and 29 transitions. [2018-11-18 15:21:06,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 15:21:06,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:21:06,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2018-11-18 15:21:06,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:21:06,737 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 15:21:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2018-11-18 15:21:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 15:21:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 15:21:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-18 15:21:06,738 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 15:21:06,738 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 15:21:06,738 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:21:06,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-18 15:21:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:06,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:06,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:06,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:06,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:21:06,739 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 322#L14 assume !(build_nondet_String_~length~0 < 1); 327#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; 316#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 317#L14-3 assume !(build_nondet_String_~length~0 < 1); 320#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; 315#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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; 306#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 308#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; 311#L34-6 [2018-11-18 15:21:06,739 INFO L796 eck$LassoCheckResult]: Loop: 311#L34-6 assume true; 312#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 324#L34-2 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); 318#L34-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;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; 311#L34-6 [2018-11-18 15:21:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-18 15:21:06,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:06,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 1 times [2018-11-18 15:21:06,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:06,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:06,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:06,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:06,765 INFO L82 PathProgramCache]: Analyzing trace with hash 111434683, now seen corresponding path program 1 times [2018-11-18 15:21:06,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:06,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:07,092 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-18 15:21:07,168 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:21:07,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:21:07,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:21:07,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:21:07,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:21:07,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:21:07,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:21:07,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:21:07,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-18 15:21:07,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:21:07,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:21:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:07,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:21:07,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:21:07,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:07,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:07,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:07,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:07,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:07,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:07,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:07,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:07,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:07,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:07,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:07,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:07,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:07,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:21:07,804 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:21:07,804 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 15:21:07,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:21:07,805 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:21:07,806 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:21:07,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 Supporting invariants [] [2018-11-18 15:21:07,832 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 15:21:07,833 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:21:07,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:07,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:07,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:07,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:21:07,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 15:21:07,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 55 states and 65 transitions. Complement of second has 7 states. [2018-11-18 15:21:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:21:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:21:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-18 15:21:07,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 15:21:07,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:07,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 15:21:07,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:07,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 15:21:07,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:07,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-18 15:21:07,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:07,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2018-11-18 15:21:07,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 15:21:07,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 15:21:07,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-18 15:21:07,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:21:07,889 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 15:21:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-18 15:21:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-11-18 15:21:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 15:21:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-18 15:21:07,891 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 15:21:07,891 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 15:21:07,891 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:21:07,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-18 15:21:07,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:07,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:07,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:07,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:07,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:21:07,893 INFO L794 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 505#L14 assume !(build_nondet_String_~length~0 < 1); 510#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; 499#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 500#L14-3 assume !(build_nondet_String_~length~0 < 1); 503#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; 498#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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; 487#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 488#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; 495#L34-6 assume true; 497#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 507#L34-2 assume !cstrpbrk_#t~short7; 508#L34-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 485#L34-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 486#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 492#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; 489#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 491#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; 493#L34-6 [2018-11-18 15:21:07,893 INFO L796 eck$LassoCheckResult]: Loop: 493#L34-6 assume true; 494#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 506#L34-2 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); 501#L34-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;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; 493#L34-6 [2018-11-18 15:21:07,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1899230978, now seen corresponding path program 1 times [2018-11-18 15:21:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:07,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:07,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:21:07,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:21:07,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:21:07,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 2 times [2018-11-18 15:21:07,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:07,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:07,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:21:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:21:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:21:08,011 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-18 15:21:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:21:08,051 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 15:21:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:21:08,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-18 15:21:08,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:08,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 35 transitions. [2018-11-18 15:21:08,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 15:21:08,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:21:08,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-18 15:21:08,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:21:08,053 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:21:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-18 15:21:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 15:21:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 15:21:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-18 15:21:08,055 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:21:08,055 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:21:08,055 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:21:08,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-18 15:21:08,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:21:08,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:21:08,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:21:08,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:21:08,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:21:08,056 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 587#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_build_nondet_String } true;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; 588#L14 assume !(build_nondet_String_~length~0 < 1); 594#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; 581#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;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; 582#L14-3 assume !(build_nondet_String_~length~0 < 1); 586#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; 580#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;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; 568#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 569#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; 583#L34-6 assume true; 593#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 591#L34-2 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); 592#L34-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 573#L34-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 574#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 579#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; 570#L31-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 572#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; 575#L34-6 [2018-11-18 15:21:08,056 INFO L796 eck$LassoCheckResult]: Loop: 575#L34-6 assume true; 576#L34-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 590#L34-2 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); 584#L34-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;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; 575#L34-6 [2018-11-18 15:21:08,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 124223616, now seen corresponding path program 2 times [2018-11-18 15:21:08,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:08,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:21:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:08,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 3 times [2018-11-18 15:21:08,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:08,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:21:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash 247646442, now seen corresponding path program 1 times [2018-11-18 15:21:08,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:21:08,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:21:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:21:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:21:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:21:08,645 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 151 [2018-11-18 15:21:09,223 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-18 15:21:09,224 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:21:09,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:21:09,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:21:09,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:21:09,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:21:09,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:21:09,225 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:21:09,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:21:09,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-18 15:21:09,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:21:09,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:21:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:21:09,699 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-18 15:21:09,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:21:09,996 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2018-11-18 15:21:10,781 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2018-11-18 15:21:10,984 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-18 15:21:11,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:21:11,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:21:11,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:11,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:11,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:21:11,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:21:11,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:21:11,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:11,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:11,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,024 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:21:11,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:21:11,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:11,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:21:11,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:21:11,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:21:11,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:21:11,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:21:11,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:21:11,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:21:11,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:21:11,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:21:11,063 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:21:11,063 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:21:11,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:21:11,064 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:21:11,064 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:21:11,064 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-11-18 15:21:11,131 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-11-18 15:21:11,133 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:21:11,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:11,228 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-11-18 15:21:11,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 15:21:11,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 49 states and 54 transitions. Complement of second has 9 states. [2018-11-18 15:21:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:21:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 15:21:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-18 15:21:11,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 15:21:11,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:11,271 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:21:11,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:11,335 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-11-18 15:21:11,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 15:21:11,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 49 states and 54 transitions. Complement of second has 9 states. [2018-11-18 15:21:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:21:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 15:21:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-18 15:21:11,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 15:21:11,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:11,382 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:21:11,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:21:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:21:11,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:21:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:21:11,430 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-11-18 15:21:11,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 15:21:11,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 50 states and 56 transitions. Complement of second has 8 states. [2018-11-18 15:21:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:21:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 15:21:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-18 15:21:11,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 15:21:11,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:11,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-18 15:21:11,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:11,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-18 15:21:11,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:21:11,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 56 transitions. [2018-11-18 15:21:11,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:21:11,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2018-11-18 15:21:11,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:21:11,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:21:11,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:21:11,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:21:11,471 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:21:11,471 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:21:11,472 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:21:11,472 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:21:11,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:21:11,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:21:11,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:21:11,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:21:11 BoogieIcfgContainer [2018-11-18 15:21:11,477 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:21:11,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:21:11,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:21:11,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:21:11,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:21:04" (3/4) ... [2018-11-18 15:21:11,480 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:21:11,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:21:11,480 INFO L168 Benchmark]: Toolchain (without parser) took 7468.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -109.1 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,481 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:21:11,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,482 INFO L168 Benchmark]: Boogie Preprocessor took 49.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,482 INFO L168 Benchmark]: RCFGBuilder took 187.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,483 INFO L168 Benchmark]: BuchiAutomizer took 7045.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.3 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:21:11,483 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:21:11,485 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7045.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.3 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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[s] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. 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 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 142 SDtfs, 173 SDslu, 152 SDs, 0 SdLazy, 192 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp45 div131 bol100 ite100 ukn100 eq170 hnf79 smp82 dnf1036 smp24 tf100 neg96 sie109 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...