./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/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 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:43:45,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:43:45,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:43:45,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:43:45,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:43:45,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:43:45,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:43:45,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:43:45,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:43:45,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:43:45,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:43:45,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:43:45,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:43:45,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:43:45,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:43:45,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:43:45,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:43:45,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:43:45,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:43:45,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:43:45,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:43:45,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:43:45,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:43:45,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:43:45,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:43:45,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:43:45,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:43:45,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:43:45,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:43:45,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:43:45,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:43:45,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:43:45,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:43:45,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:43:45,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:43:45,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:43:45,294 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:43:45,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:43:45,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:43:45,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:43:45,307 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:43:45,307 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:43:45,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:43:45,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:43:45,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:43:45,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:43:45,309 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:43:45,310 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:43:45,310 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_91fe6d89-6966-461e-b20d-316af7c001f4/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-11-18 13:43:45,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:43:45,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:43:45,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:43:45,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:43:45,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:43:45,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:43:45,381 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/data/b6e2ba589/23fd3f2bb3c04d0fbcf7615a444a035f/FLAG189720c4c [2018-11-18 13:43:45,808 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:43:45,809 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:43:45,815 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/data/b6e2ba589/23fd3f2bb3c04d0fbcf7615a444a035f/FLAG189720c4c [2018-11-18 13:43:45,824 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/bin-2019/uautomizer/data/b6e2ba589/23fd3f2bb3c04d0fbcf7615a444a035f [2018-11-18 13:43:45,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:43:45,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:43:45,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:43:45,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:43:45,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:43:45,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:43:45" (1/1) ... [2018-11-18 13:43:45,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ee2369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:45, skipping insertion in model container [2018-11-18 13:43:45,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:43:45" (1/1) ... [2018-11-18 13:43:45,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:43:45,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:43:46,051 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:43:46,059 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:43:46,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:43:46,162 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:43:46,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46 WrapperNode [2018-11-18 13:43:46,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:43:46,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:43:46,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:43:46,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:43:46,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:43:46,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:43:46,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:43:46,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:43:46,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... [2018-11-18 13:43:46,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:43:46,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:43:46,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:43:46,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:43:46,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/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 13:43:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:43:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:43:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:43:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:43:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:43:46,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:43:46,371 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:43:46,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:43:46 BoogieIcfgContainer [2018-11-18 13:43:46,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:43:46,371 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:43:46,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:43:46,374 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:43:46,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:46,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:43:45" (1/3) ... [2018-11-18 13:43:46,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ecbfe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:43:46, skipping insertion in model container [2018-11-18 13:43:46,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:46,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:46" (2/3) ... [2018-11-18 13:43:46,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ecbfe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:43:46, skipping insertion in model container [2018-11-18 13:43:46,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:46,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:43:46" (3/3) ... [2018-11-18 13:43:46,377 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 13:43:46,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:43:46,414 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:43:46,414 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:43:46,414 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:43:46,414 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:43:46,414 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:43:46,414 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:43:46,414 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:43:46,415 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:43:46,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 13:43:46,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:43:46,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:46,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:46,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:46,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:43:46,448 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:43:46,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 13:43:46,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:43:46,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:46,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:46,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:46,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:43:46,457 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#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; 7#L555true assume !(main_~length1~0 < 1); 12#L555-2true assume !(main_~length2~0 < 1); 4#L558-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; 13#L546-4true [2018-11-18 13:43:46,457 INFO L796 eck$LassoCheckResult]: Loop: 13#L546-4true assume true; 8#L545-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; 9#L545-2true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 10#L546-3true assume !true; 13#L546-4true [2018-11-18 13:43:46,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 13:43:46,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:46,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1510580, now seen corresponding path program 1 times [2018-11-18 13:43:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:46,583 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 13:43:46,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:43:46,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 13:43:46,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:43:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:43:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:43:46,597 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 13:43:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:43:46,604 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-11-18 13:43:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:43:46,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-18 13:43:46,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:43:46,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 14 transitions. [2018-11-18 13:43:46,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 13:43:46,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 13:43:46,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 13:43:46,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:46,612 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:43:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 13:43:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 13:43:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 13:43:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 13:43:46,635 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:43:46,635 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 13:43:46,635 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:43:46,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 13:43:46,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:43:46,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:46,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:46,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:46,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:46,637 INFO L794 eck$LassoCheckResult]: Stem: 48#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#L555 assume !(main_~length1~0 < 1); 42#L555-2 assume !(main_~length2~0 < 1); 43#L558-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; 44#L546-4 [2018-11-18 13:43:46,637 INFO L796 eck$LassoCheckResult]: Loop: 44#L546-4 assume true; 45#L545-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; 50#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L546-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; 49#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 44#L546-4 [2018-11-18 13:43:46,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 13:43:46,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 46827610, now seen corresponding path program 1 times [2018-11-18 13:43:46,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:46,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1593126453, now seen corresponding path program 1 times [2018-11-18 13:43:46,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:46,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:46,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:46,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:46,831 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-18 13:43:47,030 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-18 13:43:47,109 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:43:47,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:43:47,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:43:47,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:43:47,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:43:47,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:43:47,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:43:47,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:43:47,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 13:43:47,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:43:47,111 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:43:47,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:47,134 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 13:43:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:47,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:47,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:47,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:47,395 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 13:43:47,397 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 13:43:47,398 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 13:43:47,399 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 13:43:47,401 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 13:43:47,403 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 13:43:47,404 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 13:43:47,406 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 13:43:47,407 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 13:43:47,409 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 13:43:47,661 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:43:47,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:43:47,666 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 13:43:47,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:47,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:47,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:47,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,671 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 13:43:47,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:47,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:47,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:47,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,673 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 13:43:47,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:47,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:47,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:47,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,677 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 13:43:47,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:47,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:43:47,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:47,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,700 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 13:43:47,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,701 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:43:47,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,705 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:43:47,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,718 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 13:43:47,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:47,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,723 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 13:43:47,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:47,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,728 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 13:43:47,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,729 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:43:47,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:43:47,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,744 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 13:43:47,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:47,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:47,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:47,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:47,749 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 13:43:47,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:47,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:47,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:47,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:47,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:47,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:47,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:43:47,805 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 13:43:47,806 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:43:47,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:43:47,809 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:43:47,809 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:43:47,810 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 13:43:47,836 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 13:43:47,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:43:47,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:47,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:47,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:47,925 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 13:43:47,927 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 13:43:47,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 13:43:47,977 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 13:43:47,978 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 13:43:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:43:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-18 13:43:47,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-18 13:43:47,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:47,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 13:43:47,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:47,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-18 13:43:47,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:47,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-18 13:43:47,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:43:47,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 20 transitions. [2018-11-18 13:43:47,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 13:43:47,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 13:43:47,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-18 13:43:47,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:43:47,985 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 13:43:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-18 13:43:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-18 13:43:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 13:43:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 13:43:47,987 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 13:43:47,987 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 13:43:47,988 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:43:47,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 13:43:47,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:43:47,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:47,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:47,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:47,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:43:47,990 INFO L794 eck$LassoCheckResult]: Stem: 168#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#L555 assume !(main_~length1~0 < 1); 163#L555-2 assume !(main_~length2~0 < 1); 164#L558-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; 165#L546-4 assume true; 166#L545-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; 175#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 170#L546-3 [2018-11-18 13:43:47,990 INFO L796 eck$LassoCheckResult]: Loop: 170#L546-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; 173#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 169#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 170#L546-3 [2018-11-18 13:43:47,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 180428530, now seen corresponding path program 1 times [2018-11-18 13:43:47,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:47,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:47,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 1 times [2018-11-18 13:43:48,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2142279889, now seen corresponding path program 1 times [2018-11-18 13:43:48,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:48,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:48,271 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-18 13:43:48,345 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:43:48,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:43:48,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:43:48,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:43:48,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:43:48,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:43:48,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:43:48,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:43:48,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 13:43:48,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:43:48,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:43:48,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:48,354 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 13:43:48,355 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 13:43:48,357 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 13:43:48,358 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 13:43:48,359 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 13:43:48,361 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 13:43:48,537 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 13:43:48,539 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 13:43:48,539 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 13:43:48,541 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 13:43:48,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:48,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:48,543 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 13:43:48,544 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 13:43:48,545 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 13:43:48,790 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:43:48,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:43:48,791 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 13:43:48,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:48,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:48,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:48,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,793 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 13:43:48,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:48,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:48,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:48,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,795 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 13:43:48,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:48,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:48,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:48,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,796 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 13:43:48,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:48,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:48,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:48,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,798 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 13:43:48,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,801 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 13:43:48,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:48,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:48,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:48,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,803 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 13:43:48,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,803 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:43:48,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,804 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:43:48,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,808 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 13:43:48,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,811 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 13:43:48,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,814 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 13:43:48,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,816 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 13:43:48,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,819 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 13:43:48,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,821 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 13:43:48,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,827 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 13:43:48,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:48,831 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 13:43:48,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:48,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:48,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:48,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:48,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:48,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:48,846 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:43:48,856 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 13:43:48,856 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:43:48,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:43:48,857 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:43:48,858 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:43:48,858 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 13:43:48,897 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 13:43:48,898 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:43:48,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:48,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:48,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:48,956 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 13:43:48,956 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 13:43:48,956 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 13:43:48,980 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 13:43:48,981 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 13:43:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:43:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 13:43:48,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 13:43:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:48,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 13:43:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:48,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 13:43:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:48,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-18 13:43:48,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:43:48,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 30 transitions. [2018-11-18 13:43:48,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 13:43:48,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 13:43:48,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 13:43:48,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:43:48,985 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 13:43:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 13:43:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-18 13:43:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:43:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 13:43:48,986 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 13:43:48,986 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 13:43:48,987 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:43:48,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 13:43:48,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:43:48,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:48,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:48,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:48,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:43:48,988 INFO L794 eck$LassoCheckResult]: Stem: 337#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#L555 assume !(main_~length1~0 < 1); 327#L555-2 assume !(main_~length2~0 < 1); 328#L558-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; 329#L546-4 assume true; 330#L545-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; 341#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 336#L546-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; 339#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 331#L546-4 assume true; 332#L545-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; 340#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 334#L546-3 [2018-11-18 13:43:48,988 INFO L796 eck$LassoCheckResult]: Loop: 334#L546-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; 338#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 333#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 334#L546-3 [2018-11-18 13:43:48,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1441559459, now seen corresponding path program 2 times [2018-11-18 13:43:48,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:49,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 2 times [2018-11-18 13:43:49,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:49,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:49,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:49,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 119880320, now seen corresponding path program 1 times [2018-11-18 13:43:49,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:49,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:49,066 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 13:43:49,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:43:49,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91fe6d89-6966-461e-b20d-316af7c001f4/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 13:43:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:49,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:49,122 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 13:43:49,124 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 13:43:49,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:43:49,146 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 13:43:49,150 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 13:43:49,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:43:49,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:43:49,170 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 13:43:49,174 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 13:43:49,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-18 13:43:53,250 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 13:43:56,717 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 13:43:56,734 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 13:43:56,743 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 13:43:56,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:43:56,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:43:56,745 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 13:43:56,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-18 13:43:56,747 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 13:43:56,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:43:56,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-18 13:43:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:43:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-11-18 13:43:56,789 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-18 13:43:59,599 WARN L180 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-18 13:44:03,052 WARN L180 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-18 13:44:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:44:03,081 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-18 13:44:03,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:44:03,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-11-18 13:44:03,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:44:03,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 30 transitions. [2018-11-18 13:44:03,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 13:44:03,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 13:44:03,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-18 13:44:03,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:44:03,084 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-18 13:44:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-18 13:44:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-11-18 13:44:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 13:44:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 13:44:03,085 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 13:44:03,085 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 13:44:03,085 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:44:03,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 13:44:03,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:44:03,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:44:03,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:44:03,086 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:44:03,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:44:03,087 INFO L794 eck$LassoCheckResult]: Stem: 455#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#L555 assume !(main_~length1~0 < 1); 449#L555-2 assume !(main_~length2~0 < 1); 450#L558-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; 451#L546-4 assume true; 452#L545-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; 463#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 464#L546-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; 461#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 458#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 459#L546-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#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 453#L546-4 assume true; 454#L545-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; 462#L545-2 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 457#L546-3 [2018-11-18 13:44:03,087 INFO L796 eck$LassoCheckResult]: Loop: 457#L546-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; 460#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 456#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 457#L546-3 [2018-11-18 13:44:03,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1790358236, now seen corresponding path program 2 times [2018-11-18 13:44:03,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:44:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:44:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:44:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash 59746, now seen corresponding path program 3 times [2018-11-18 13:44:03,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:44:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:44:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:44:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1658296993, now seen corresponding path program 3 times [2018-11-18 13:44:03,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:44:03,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:44:03,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:44:03,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:44:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:44:03,623 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 156 [2018-11-18 13:44:03,727 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-18 13:44:03,729 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:44:03,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:44:03,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:44:03,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:44:03,729 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:44:03,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:44:03,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:44:03,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:44:03,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 13:44:03,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:44:03,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:44:03,732 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 13:44:03,733 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 13:44:03,734 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 13:44:03,739 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 13:44:03,740 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 13:44:03,741 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 13:44:03,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:44:03,744 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 13:44:03,745 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 13:44:03,746 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 13:44:03,748 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 13:44:03,749 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 13:44:03,751 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 13:44:03,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:44:03,753 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 13:44:04,037 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-18 13:44:04,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 13:44:04,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 13:44:04,668 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-18 13:44:04,720 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:44:04,720 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:44:04,721 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 13:44:04,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,723 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 13:44:04,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:44:04,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:44:04,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,732 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 13:44:04,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,735 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 13:44:04,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,737 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 13:44:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,738 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 13:44:04,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,740 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 13:44:04,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,742 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 13:44:04,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,744 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 13:44:04,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,747 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 13:44:04,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,748 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 13:44:04,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,750 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 13:44:04,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:44:04,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:44:04,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:44:04,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,752 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 13:44:04,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,753 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:44:04,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,754 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:44:04,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,759 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 13:44:04,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,764 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 13:44:04,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,778 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 13:44:04,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:44:04,780 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 13:44:04,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:44:04,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:44:04,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:44:04,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:44:04,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:44:04,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:44:04,804 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:44:04,818 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 13:44:04,819 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:44:04,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:44:04,820 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:44:04,820 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:44:04,820 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 13:44:04,915 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-18 13:44:04,917 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:44:04,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:04,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:04,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:04,972 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 13:44:04,972 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 13:44:04,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 13:44:04,996 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 13:44:04,998 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 13:44:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 13:44:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-18 13:44:04,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 13:44:04,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:44:04,999 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:44:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:05,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:05,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:05,057 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 13:44:05,057 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 13:44:05,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 13:44:05,090 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 13:44:05,091 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 13:44:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 13:44:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-18 13:44:05,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 13:44:05,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:44:05,091 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:44:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:44:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:05,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:44:05,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:44:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:44:05,141 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 13:44:05,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 13:44:05,158 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 13:44:05,159 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 13:44:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 13:44:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-18 13:44:05,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 13:44:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:44:05,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 13:44:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:44:05,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 13:44:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:44:05,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 13:44:05,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:44:05,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-18 13:44:05,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:44:05,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:44:05,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:44:05,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:44:05,162 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:44:05,162 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:44:05,162 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:44:05,162 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:44:05,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:44:05,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:44:05,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:44:05,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:44:05 BoogieIcfgContainer [2018-11-18 13:44:05,167 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:44:05,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:44:05,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:44:05,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:44:05,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:43:46" (3/4) ... [2018-11-18 13:44:05,170 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:44:05,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:44:05,171 INFO L168 Benchmark]: Toolchain (without parser) took 19345.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -289.9 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:44:05,171 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:44:05,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:44:05,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.49 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:44:05,172 INFO L168 Benchmark]: Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:44:05,173 INFO L168 Benchmark]: RCFGBuilder took 165.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:44:05,173 INFO L168 Benchmark]: BuchiAutomizer took 18795.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.7 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:44:05,176 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:44:05,178 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.49 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 165.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18795.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.7 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.8s. Construction of modules took 0.0s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 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 ax100 hnf99 lsp96 ukn80 mio100 lsp42 div100 bol100 ite100 ukn100 eq191 hnf87 smp97 dnf232 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms 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...