./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i --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_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/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 2f11210fb32f4d3c697b29c6d0c40652627e6e63 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:34:51,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:51,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:51,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:51,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:51,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:51,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:51,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:51,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:51,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:51,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:51,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:51,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:51,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:51,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:51,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:51,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:51,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:51,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:51,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:51,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:51,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:51,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:51,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:51,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:51,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:51,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:51,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:51,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:51,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:51,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:51,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:51,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:51,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:51,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:51,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:51,312 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:51,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:51,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:51,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:51,324 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:51,324 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:51,325 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:51,325 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:51,325 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:51,325 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:51,325 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:51,325 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:51,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:51,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:51,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:51,327 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:51,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:51,328 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:51,328 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:51,329 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:51,329 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_67550f10-d8b5-4d75-b435-26b74f476441/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 -> 2f11210fb32f4d3c697b29c6d0c40652627e6e63 [2018-11-18 08:34:51,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:51,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:51,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:51,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:51,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:51,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-18 08:34:51,407 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/data/8e703d727/f43a00ea3b0d43e181830e2ce64030aa/FLAGea43b01cb [2018-11-18 08:34:51,781 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:51,781 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-18 08:34:51,788 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/data/8e703d727/f43a00ea3b0d43e181830e2ce64030aa/FLAGea43b01cb [2018-11-18 08:34:52,169 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/bin-2019/uautomizer/data/8e703d727/f43a00ea3b0d43e181830e2ce64030aa [2018-11-18 08:34:52,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:52,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:52,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:52,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:52,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:52,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b79846f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52, skipping insertion in model container [2018-11-18 08:34:52,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:52,211 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:52,441 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:52,447 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:52,479 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:52,564 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:52,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52 WrapperNode [2018-11-18 08:34:52,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:52,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:52,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:52,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:52,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:52,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:52,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:52,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:52,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:52,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:52,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:52,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:52,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67550f10-d8b5-4d75-b435-26b74f476441/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 08:34:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:52,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:52,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:52,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:52 BoogieIcfgContainer [2018-11-18 08:34:52,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:52,830 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:52,830 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:52,832 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:52,832 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:52,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:52" (1/3) ... [2018-11-18 08:34:52,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9a759f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:52, skipping insertion in model container [2018-11-18 08:34:52,833 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:52,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (2/3) ... [2018-11-18 08:34:52,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9a759f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:52, skipping insertion in model container [2018-11-18 08:34:52,834 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:52,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:52" (3/3) ... [2018-11-18 08:34:52,835 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-18 08:34:52,872 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:52,873 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:52,873 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:52,873 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:52,873 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:52,873 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:52,873 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:52,873 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:52,874 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:52,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:34:52,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:34:52,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:52,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:52,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:52,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:52,912 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:52,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:34:52,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:34:52,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:52,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:52,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:52,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:52,921 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 13#L382true assume !(main_~length1~0 < 1); 17#L382-2true assume !(main_~length2~0 < 1); 11#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 6#L369-4true [2018-11-18 08:34:52,922 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 19#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 4#L372-6true assume !true; 7#L372-7true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 9#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-18 08:34:52,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 08:34:52,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 08:34:53,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,054 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 08:34:53,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:53,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:34:53,058 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:34:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:34:53,069 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 08:34:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:53,074 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 08:34:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:34:53,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 08:34:53,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:34:53,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 08:34:53,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 08:34:53,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 08:34:53,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 08:34:53,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:53,081 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 08:34:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 08:34:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 08:34:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 08:34:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 08:34:53,100 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 08:34:53,100 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 08:34:53,100 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:53,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 08:34:53,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:34:53,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:53,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:53,102 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 54#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 55#L382 assume !(main_~length1~0 < 1); 56#L382-2 assume !(main_~length2~0 < 1); 53#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 49#L369-4 [2018-11-18 08:34:53,102 INFO L796 eck$LassoCheckResult]: Loop: 49#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 50#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 46#L372-6 assume true; 47#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 57#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 59#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 51#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 52#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 48#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 49#L369-4 [2018-11-18 08:34:53,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 08:34:53,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 08:34:53,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 08:34:53,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,375 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-18 08:34:53,541 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-18 08:34:53,698 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 08:34:53,771 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:53,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:53,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:53,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:53,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:53,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:53,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:53,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:53,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 08:34:53,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:53,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:53,791 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 08:34:53,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,811 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 08:34:53,813 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 08:34:53,815 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 08:34:53,819 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 08:34:53,825 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 08:34:53,831 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 08:34:53,834 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 08:34:53,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,840 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 08:34:53,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,843 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 08:34:53,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,857 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 08:34:54,032 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-11-18 08:34:54,142 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 08:34:54,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:54,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:54,556 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 08:34:54,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:54,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,565 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 08:34:54,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,567 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 08:34:54,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:54,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,572 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 08:34:54,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,574 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 08:34:54,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,577 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 08:34:54,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:54,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,582 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 08:34:54,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,584 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 08:34:54,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,586 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 08:34:54,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,589 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 08:34:54,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,591 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 08:34:54,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,593 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 08:34:54,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,595 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 08:34:54,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,597 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 08:34:54,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,599 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 08:34:54,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,602 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 08:34:54,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,604 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 08:34:54,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:54,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:54,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:54,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:54,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:54,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,614 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 08:34:54,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,615 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:54,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:54,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,634 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 08:34:54,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:54,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:54,638 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 08:34:54,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:54,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:54,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:54,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:54,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:54,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:54,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:54,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:54,693 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 08:34:54,695 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:54,696 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:54,697 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:54,697 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 2*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1 Supporting invariants [] [2018-11-18 08:34:54,722 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 08:34:54,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,787 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 08:34:54,789 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 08:34:54,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 08:34:54,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 08:34:54,816 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 08:34:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 08:34:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 08:34:54,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 08:34:54,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:54,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 08:34:54,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:54,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 08:34:54,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:54,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 08:34:54,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 08:34:54,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:34:54,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:34:54,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 08:34:54,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,822 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 08:34:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 08:34:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 08:34:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:34:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 08:34:54,825 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 08:34:54,825 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 08:34:54,825 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:54,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 08:34:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,826 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 194#L382 assume !(main_~length1~0 < 1); 195#L382-2 assume !(main_~length2~0 < 1); 192#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 187#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 189#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 181#L372-6 [2018-11-18 08:34:54,826 INFO L796 eck$LassoCheckResult]: Loop: 181#L372-6 assume true; 182#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 196#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 199#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 181#L372-6 [2018-11-18 08:34:54,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 08:34:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 08:34:54,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 08:34:54,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,176 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-18 08:34:55,247 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:55,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:55,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:55,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:55,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:55,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:55,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:55,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:55,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 08:34:55,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:55,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:55,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:55,254 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 08:34:55,256 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 08:34:55,257 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 08:34:55,258 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 08:34:55,260 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 08:34:55,262 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 08:34:55,263 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 08:34:55,264 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 08:34:55,265 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 08:34:55,433 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-18 08:34:55,489 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 08:34:55,490 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 08:34:55,491 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 08:34:55,492 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 08:34:55,492 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 08:34:55,493 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 08:34:55,495 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 08:34:55,496 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 08:34:55,496 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 08:34:55,796 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-18 08:34:55,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:55,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:55,902 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 08:34:55,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,905 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 08:34:55,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,907 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 08:34:55,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:55,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:55,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,909 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 08:34:55,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,910 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 08:34:55,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,912 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 08:34:55,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,914 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 08:34:55,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,915 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 08:34:55,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:55,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:55,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,919 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 08:34:55,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,921 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 08:34:55,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,926 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 08:34:55,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:55,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:55,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,929 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 08:34:55,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,929 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:55,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:55,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:55,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,940 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 08:34:55,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:55,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:55,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,942 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 08:34:55,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,942 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:55,942 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 08:34:55,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,961 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-18 08:34:55,961 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 08:34:56,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,021 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 08:34:56,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,021 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:56,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,023 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:56,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,027 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 08:34:56,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:56,052 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:34:56,052 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 08:34:56,053 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:56,053 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:56,054 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:56,054 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 Supporting invariants [] [2018-11-18 08:34:56,108 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 08:34:56,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:56,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:56,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:56,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:56,162 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 08:34:56,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 08:34:56,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 08:34:56,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 08:34:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 08:34:56,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 08:34:56,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:56,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 08:34:56,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:56,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 08:34:56,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:56,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 08:34:56,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:56,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 08:34:56,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 08:34:56,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 08:34:56,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 08:34:56,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:56,201 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 08:34:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 08:34:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 08:34:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 08:34:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 08:34:56,203 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 08:34:56,203 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 08:34:56,203 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:56,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 08:34:56,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:56,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:56,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:56,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:56,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:56,207 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 389#L382 assume !(main_~length1~0 < 1); 390#L382-2 assume !(main_~length2~0 < 1); 387#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 383#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 384#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 397#L372-6 assume true; 401#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 400#L372-2 assume !cstrpbrk_#t~short210; 398#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 381#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 382#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 379#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 380#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 386#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 375#L372-6 [2018-11-18 08:34:56,207 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-6 assume true; 376#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 391#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 394#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 375#L372-6 [2018-11-18 08:34:56,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 08:34:56,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:56,247 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 08:34:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:34:56,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:56,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 08:34:56,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:56,364 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 08:34:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:56,417 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 08:34:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:34:56,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 08:34:56,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:56,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2018-11-18 08:34:56,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 08:34:56,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 08:34:56,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 08:34:56,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:56,421 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 08:34:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 08:34:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 08:34:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 08:34:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 08:34:56,423 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 08:34:56,423 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 08:34:56,423 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:56,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2018-11-18 08:34:56,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:56,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:56,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:56,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:56,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:56,425 INFO L794 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 468#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 469#L382 assume !(main_~length1~0 < 1); 470#L382-2 assume !(main_~length2~0 < 1); 467#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 461#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 462#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 481#L372-6 assume true; 472#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 473#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 479#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 465#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 466#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 459#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 460#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 464#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 455#L372-6 [2018-11-18 08:34:56,425 INFO L796 eck$LassoCheckResult]: Loop: 455#L372-6 assume true; 456#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 471#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 475#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 455#L372-6 [2018-11-18 08:34:56,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 08:34:56,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 08:34:56,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 08:34:56,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,961 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 132 [2018-11-18 08:34:57,511 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-18 08:34:57,512 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:57,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:57,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:57,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:57,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:57,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:57,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:57,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 08:34:57,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:57,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:57,518 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 08:34:57,523 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 08:34:57,525 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 08:34:57,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,670 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 08:34:58,038 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2018-11-18 08:34:58,131 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 08:34:58,133 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 08:34:58,133 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 08:34:58,135 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 08:34:58,136 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 08:34:58,137 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 08:34:58,138 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 08:34:58,139 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 08:34:58,140 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 08:34:58,141 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 08:34:58,142 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 08:34:58,143 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 08:34:58,144 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 08:34:58,145 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 08:34:58,413 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-11-18 08:34:58,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 08:35:00,373 WARN L180 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-11-18 08:35:00,657 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-18 08:35:00,669 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:00,669 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:00,669 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 08:35:00,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,674 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 08:35:00,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,676 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 08:35:00,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,678 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 08:35:00,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:00,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:00,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,683 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 08:35:00,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:00,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:00,707 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:00,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:00,716 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 08:35:00,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:00,717 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 08:35:00,717 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:00,717 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3 + 4*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3 - 2 >= 0] [2018-11-18 08:35:00,814 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-18 08:35:00,816 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:35:00,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:00,902 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 08:35:00,902 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-18 08:35:00,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-18 08:35:00,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 30 states and 39 transitions. Complement of second has 4 states. [2018-11-18 08:35:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 08:35:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 08:35:00,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 08:35:00,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:00,930 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:00,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:01,012 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 08:35:01,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-18 08:35:01,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-18 08:35:01,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 30 states and 39 transitions. Complement of second has 4 states. [2018-11-18 08:35:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 08:35:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 08:35:01,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 08:35:01,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:01,038 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:01,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:01,098 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 08:35:01,099 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-18 08:35:01,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-18 08:35:01,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 50 states and 62 transitions. Complement of second has 10 states. [2018-11-18 08:35:01,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 08:35:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 08:35:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-18 08:35:01,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 08:35:01,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:01,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 08:35:01,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:01,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 08:35:01,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:01,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2018-11-18 08:35:01,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:01,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2018-11-18 08:35:01,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:35:01,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:35:01,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:35:01,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:01,222 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,222 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,222 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,222 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:35:01,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:35:01,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:01,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:35:01,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:35:01 BoogieIcfgContainer [2018-11-18 08:35:01,228 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:35:01,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:01,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:01,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:01,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:52" (3/4) ... [2018-11-18 08:35:01,233 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:35:01,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:01,233 INFO L168 Benchmark]: Toolchain (without parser) took 9062.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -82.6 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,234 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:01,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,236 INFO L168 Benchmark]: Boogie Preprocessor took 19.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,236 INFO L168 Benchmark]: RCFGBuilder took 214.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,236 INFO L168 Benchmark]: BuchiAutomizer took 8398.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 324.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,237 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:01,240 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8398.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 324.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + 4 * s and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 107 SDtfs, 124 SDslu, 136 SDs, 0 SdLazy, 123 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp63 div102 bol100 ite100 ukn100 eq192 hnf88 smp79 dnf1409 smp30 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 77ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...