./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-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_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/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 c10d45b5c95e322c3a9476f6a89ce233987fcc3d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:37:09,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:37:09,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:37:09,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:37:09,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:37:09,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:37:09,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:37:09,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:37:09,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:37:09,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:37:09,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:37:09,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:37:09,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:37:09,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:37:09,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:37:09,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:37:09,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:37:09,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:37:09,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:37:09,408 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:37:09,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:37:09,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:37:09,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:37:09,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:37:09,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:37:09,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:37:09,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:37:09,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:37:09,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:37:09,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:37:09,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:37:09,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:37:09,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:37:09,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:37:09,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:37:09,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:37:09,417 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:37:09,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:37:09,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:37:09,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:37:09,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:37:09,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:37:09,427 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:37:09,427 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:37:09,427 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:37:09,428 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:37:09,428 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:37:09,428 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:37:09,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:37:09,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:37:09,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:37:09,429 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:37:09,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:37:09,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:37:09,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:37:09,430 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:37:09,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:37:09,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:37:09,431 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:37:09,431 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:37:09,432 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_039529a1-31ab-4029-9b71-20bf6be494b7/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 -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-11-18 12:37:09,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:37:09,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:37:09,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:37:09,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:37:09,472 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:37:09,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-18 12:37:09,514 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/data/4ec924387/e1e81bcbb7444dafb1c4b6d9f679d02d/FLAG65e91f28e [2018-11-18 12:37:09,892 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:37:09,892 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-18 12:37:09,901 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/data/4ec924387/e1e81bcbb7444dafb1c4b6d9f679d02d/FLAG65e91f28e [2018-11-18 12:37:10,281 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/data/4ec924387/e1e81bcbb7444dafb1c4b6d9f679d02d [2018-11-18 12:37:10,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:37:10,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:37:10,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:37:10,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:37:10,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:37:10,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fefe927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10, skipping insertion in model container [2018-11-18 12:37:10,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:37:10,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:37:10,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:37:10,510 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:37:10,539 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:37:10,613 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:37:10,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10 WrapperNode [2018-11-18 12:37:10,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:37:10,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:37:10,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:37:10,614 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:37:10,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:37:10,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:37:10,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:37:10,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:37:10,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... [2018-11-18 12:37:10,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:37:10,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:37:10,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:37:10,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:37:10,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/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 12:37:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:37:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:37:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:37:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:37:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:37:10,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:37:10,834 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:37:10,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:37:10 BoogieIcfgContainer [2018-11-18 12:37:10,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:37:10,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:37:10,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:37:10,837 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:37:10,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:37:10,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:37:10" (1/3) ... [2018-11-18 12:37:10,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@168e5d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:37:10, skipping insertion in model container [2018-11-18 12:37:10,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:37:10,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:37:10" (2/3) ... [2018-11-18 12:37:10,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@168e5d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:37:10, skipping insertion in model container [2018-11-18 12:37:10,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:37:10,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:37:10" (3/3) ... [2018-11-18 12:37:10,840 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-18 12:37:10,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:37:10,877 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:37:10,877 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:37:10,877 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:37:10,877 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:37:10,877 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:37:10,877 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:37:10,877 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:37:10,877 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:37:10,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:37:10,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:37:10,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:10,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:10,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:37:10,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:37:10,911 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:37:10,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:37:10,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:37:10,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:10,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:10,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:37:10,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:37:10,919 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 11#L562true assume !(main_~length1~0 < 1); 16#L562-2true assume !(main_~length2~0 < 1); 7#L565-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 18#L553-4true [2018-11-18 12:37:10,920 INFO L796 eck$LassoCheckResult]: Loop: 18#L553-4true assume true; 12#L552-1true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 14#L552-2true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 15#L553-3true assume !true; 18#L553-4true [2018-11-18 12:37:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 12:37:10,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:10,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:10,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1510580, now seen corresponding path program 1 times [2018-11-18 12:37:11,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:11,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:11,048 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 12:37:11,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:37:11,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 12:37:11,053 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:37:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:37:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:37:11,064 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 12:37:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:11,069 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-11-18 12:37:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:37:11,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-18 12:37:11,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:37:11,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 14 transitions. [2018-11-18 12:37:11,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:37:11,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:37:11,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 12:37:11,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:37:11,075 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:37:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 12:37:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 12:37:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 12:37:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 12:37:11,092 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:37:11,092 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:37:11,092 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:37:11,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 12:37:11,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:37:11,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:11,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:11,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:37:11,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:37:11,094 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 41#L562 assume !(main_~length1~0 < 1); 47#L562-2 assume !(main_~length2~0 < 1); 42#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 43#L553-4 [2018-11-18 12:37:11,094 INFO L796 eck$LassoCheckResult]: Loop: 43#L553-4 assume true; 48#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 49#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 50#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 45#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 43#L553-4 [2018-11-18 12:37:11,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 12:37:11,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 46827610, now seen corresponding path program 1 times [2018-11-18 12:37:11,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:11,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:37:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1593126453, now seen corresponding path program 1 times [2018-11-18 12:37:11,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:11,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:11,494 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-18 12:37:11,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:37:11,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:37:11,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:37:11,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:37:11,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:37:11,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:37:11,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:37:11,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:37:11,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 12:37:11,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:37:11,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:37:11,587 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 12:37:11,590 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 12:37:11,592 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 12:37:11,842 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 12:37:11,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 12:37:11,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 12:37:11,846 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 12:37:11,847 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 12:37:11,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 12:37:11,850 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 12:37:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:11,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:11,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 12:37:11,855 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 12:37:11,856 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 12:37:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:11,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:11,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:11,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:12,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:37:12,165 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:37:12,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:12,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:12,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:12,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:12,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,172 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 12:37:12,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:12,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:12,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:12,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,175 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 12:37:12,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:12,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:12,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:12,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,178 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 12:37:12,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:12,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,185 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 12:37:12,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:12,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,200 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 12:37:12,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,201 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:37:12,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:37:12,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,216 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 12:37:12,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:12,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,222 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 12:37:12,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:12,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,230 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 12:37:12,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,230 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:37:12,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,234 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:37:12,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,244 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 12:37:12,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:12,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:12,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:12,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:12,246 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 12:37:12,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:12,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:12,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:12,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:12,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:12,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:12,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:37:12,310 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:37:12,310 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:37:12,312 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:37:12,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:37:12,313 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:37:12,313 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-11-18 12:37:12,352 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 12:37:12,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:37:12,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:12,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:12,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:12,457 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 12:37:12,459 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 12:37:12,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 12:37:12,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 19 states and 23 transitions. Complement of second has 4 states. [2018-11-18 12:37:12,524 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 12:37:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:37:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-18 12:37:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-18 12:37:12,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 12:37:12,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-18 12:37:12,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:12,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-18 12:37:12,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:12,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 20 transitions. [2018-11-18 12:37:12,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:37:12,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 12:37:12,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-18 12:37:12,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:37:12,531 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 12:37:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-18 12:37:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-18 12:37:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:37:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 12:37:12,532 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 12:37:12,532 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 12:37:12,532 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:37:12,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 12:37:12,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:12,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:12,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:12,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:12,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:37:12,534 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 162#L562 assume !(main_~length1~0 < 1); 171#L562-2 assume !(main_~length2~0 < 1); 163#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 164#L553-4 assume true; 172#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 173#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 174#L553-3 [2018-11-18 12:37:12,534 INFO L796 eck$LassoCheckResult]: Loop: 174#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 166#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 167#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 174#L553-3 [2018-11-18 12:37:12,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash 180428530, now seen corresponding path program 1 times [2018-11-18 12:37:12,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:12,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:12,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 1 times [2018-11-18 12:37:12,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:12,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:12,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:12,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2142279889, now seen corresponding path program 1 times [2018-11-18 12:37:12,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:12,791 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-18 12:37:12,867 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:37:12,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:37:12,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:37:12,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:37:12,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:37:12,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:37:12,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:37:12,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:37:12,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 12:37:12,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:37:12,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:37:12,871 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 12:37:12,888 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 12:37:12,891 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 12:37:12,892 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 12:37:12,893 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 12:37:12,895 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 12:37:12,896 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 12:37:13,108 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 12:37:13,109 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 12:37:13,110 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 12:37:13,111 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 12:37:13,112 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 12:37:13,113 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 12:37:13,114 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 12:37:13,116 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 12:37:13,117 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 12:37:13,118 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 12:37:13,119 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 12:37:13,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:13,387 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:37:13,387 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:37:13,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:13,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:13,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:13,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,390 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 12:37:13,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:13,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:13,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:13,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,396 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 12:37:13,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:13,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:13,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:13,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,397 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 12:37:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:13,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:13,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:13,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,399 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 12:37:13,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:13,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:13,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:13,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,404 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 12:37:13,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:37:13,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:37:13,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,414 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 12:37:13,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,418 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 12:37:13,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:37:13,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:13,439 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 12:37:13,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:13,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:13,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:13,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:13,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:13,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:13,454 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:37:13,466 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:37:13,466 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:37:13,467 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:37:13,468 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:37:13,468 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:37:13,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-18 12:37:13,514 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 12:37:13,516 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:37:13,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:13,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:13,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:13,594 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 12:37:13,595 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 12:37:13,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 12:37:13,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 35 states and 42 transitions. Complement of second has 6 states. [2018-11-18 12:37:13,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:37:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:37:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 12:37:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 12:37:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 12:37:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 12:37:13,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:13,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-18 12:37:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:13,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 30 transitions. [2018-11-18 12:37:13,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:37:13,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 12:37:13,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 12:37:13,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:37:13,656 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 12:37:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 12:37:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-18 12:37:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 12:37:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 12:37:13,658 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 12:37:13,658 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 12:37:13,658 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:37:13,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 12:37:13,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:13,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:13,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:13,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:13,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:37:13,663 INFO L794 eck$LassoCheckResult]: Stem: 329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 325#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 326#L562 assume !(main_~length1~0 < 1); 335#L562-2 assume !(main_~length2~0 < 1); 327#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 328#L553-4 assume true; 341#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 338#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 339#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 332#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 333#L553-4 assume true; 336#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 337#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 340#L553-3 [2018-11-18 12:37:13,663 INFO L796 eck$LassoCheckResult]: Loop: 340#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 330#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 331#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 340#L553-3 [2018-11-18 12:37:13,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1441559459, now seen corresponding path program 2 times [2018-11-18 12:37:13,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:13,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 2 times [2018-11-18 12:37:13,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:13,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:37:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash 119880320, now seen corresponding path program 1 times [2018-11-18 12:37:13,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:37:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:37:13,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:13,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039529a1-31ab-4029-9b71-20bf6be494b7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:13,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:13,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-18 12:37:13,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 12:37:13,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:37:13,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 12:37:13,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 12:37:13,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:37:13,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:37:13,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:37:13,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-18 12:37:13,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-18 12:37:17,977 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 12:37:21,333 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 12:37:21,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 12:37:21,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-18 12:37:21,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:37:21,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:37:21,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:37:21,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-18 12:37:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:37:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:37:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-18 12:37:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:37:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-11-18 12:37:21,385 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-18 12:37:24,918 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-18 12:37:28,137 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-18 12:37:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:28,164 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-18 12:37:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:37:28,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-11-18 12:37:28,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:28,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 30 transitions. [2018-11-18 12:37:28,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:37:28,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:37:28,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-18 12:37:28,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:37:28,165 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-18 12:37:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-18 12:37:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-11-18 12:37:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 12:37:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 12:37:28,166 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:37:28,166 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:37:28,166 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:37:28,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 12:37:28,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:37:28,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:37:28,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:37:28,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:28,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:37:28,167 INFO L794 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 448#L562 assume !(main_~length1~0 < 1); 456#L562-2 assume !(main_~length2~0 < 1); 449#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 450#L553-4 assume true; 462#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 459#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 460#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 454#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 455#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 464#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 465#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 463#L553-4 assume true; 457#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 458#L552-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 461#L553-3 [2018-11-18 12:37:28,167 INFO L796 eck$LassoCheckResult]: Loop: 461#L553-3 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 452#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 453#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 461#L553-3 [2018-11-18 12:37:28,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1790358236, now seen corresponding path program 2 times [2018-11-18 12:37:28,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:28,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 3 times [2018-11-18 12:37:28,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:28,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:37:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1658296993, now seen corresponding path program 3 times [2018-11-18 12:37:28,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:28,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:28,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:37:28,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:37:28,718 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 156 [2018-11-18 12:37:28,818 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:37:28,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:37:28,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:37:28,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:37:28,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:37:28,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:37:28,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:37:28,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:37:28,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 12:37:28,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:37:28,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:37:28,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:28,823 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 12:37:28,824 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 12:37:28,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 12:37:28,827 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 12:37:28,830 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 12:37:28,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 12:37:28,833 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 12:37:28,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 12:37:28,836 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 12:37:28,837 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 12:37:28,839 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 12:37:28,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 12:37:28,842 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 12:37:28,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 12:37:28,845 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 12:37:28,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:29,139 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-18 12:37:29,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:29,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:29,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:37:29,780 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-18 12:37:29,829 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:37:29,829 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:37:29,829 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 12:37:29,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,835 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 12:37:29,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,836 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 12:37:29,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,837 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 12:37:29,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,839 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 12:37:29,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,842 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 12:37:29,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,843 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 12:37:29,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,845 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 12:37:29,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,848 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 12:37:29,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,849 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 12:37:29,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,851 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 12:37:29,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,853 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 12:37:29,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,856 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 12:37:29,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,857 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 12:37:29,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,859 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 12:37:29,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,861 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 12:37:29,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:37:29,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:37:29,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:37:29,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,862 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 12:37:29,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,863 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:37:29,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:37:29,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,868 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 12:37:29,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,873 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 12:37:29,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,875 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 12:37:29,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:37:29,877 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 12:37:29,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:37:29,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:37:29,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:37:29,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:37:29,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:37:29,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:37:29,900 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:37:29,919 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:37:29,919 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:37:29,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:37:29,920 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:37:29,920 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:37:29,921 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-18 12:37:30,002 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-18 12:37:30,003 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:37:30,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,049 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 12:37:30,049 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 12:37:30,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 12:37:30,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 5 states. [2018-11-18 12:37:30,069 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 12:37:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:37:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-18 12:37:30,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:37:30,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:30,070 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:37:30,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,108 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 12:37:30,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:37:30,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 12:37:30,128 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 33 states and 40 transitions. Complement of second has 5 states. [2018-11-18 12:37:30,128 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 12:37:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:37:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-18 12:37:30,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:37:30,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:30,129 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:37:30,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:30,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:30,180 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 12:37:30,181 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:37:30,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 12:37:30,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 4 states. [2018-11-18 12:37:30,196 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 12:37:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:37:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-18 12:37:30,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:37:30,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:30,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 12:37:30,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:30,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 12:37:30,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:37:30,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 12:37:30,198 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:37:30,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:37:30,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:37:30,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:37:30,199 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:37:30,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:37:30,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:37:30,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:37:30,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:37:30 BoogieIcfgContainer [2018-11-18 12:37:30,204 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:37:30,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:37:30,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:37:30,205 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:37:30,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:37:10" (3/4) ... [2018-11-18 12:37:30,207 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:37:30,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:37:30,208 INFO L168 Benchmark]: Toolchain (without parser) took 19920.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -81.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,208 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:37:30,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,210 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,210 INFO L168 Benchmark]: RCFGBuilder took 172.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,210 INFO L168 Benchmark]: BuchiAutomizer took 19369.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:37:30,211 INFO L168 Benchmark]: Witness Printer took 3.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:37:30,213 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19369.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.07 ms. Allocated memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.9s. Construction of modules took 0.0s. Büchi inclusion checks took 7.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 107 SDslu, 73 SDs, 0 SdLazy, 106 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf99 lsp89 ukn80 mio100 lsp42 div100 bol100 ite100 ukn100 eq191 hnf87 smp97 dnf232 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...