./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a3019657b4c9b0e8c0aa3e888313d420fe28d28 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:04:44,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:04:44,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:04:44,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:04:44,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:04:44,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:04:44,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:04:44,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:04:44,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:04:44,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:04:44,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:04:44,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:04:44,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:04:44,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:04:44,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:04:44,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:04:44,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:04:44,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:04:44,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:04:44,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:04:44,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:04:44,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:04:44,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:04:44,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:04:44,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:04:44,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:04:44,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:04:44,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:04:44,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:04:44,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:04:44,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:04:44,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:04:44,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:04:44,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:04:44,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:04:44,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:04:44,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:04:44,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:04:44,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:04:44,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:04:44,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:04:44,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:04:44,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:04:44,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:04:44,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:04:44,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:04:44,465 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:04:44,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:04:44,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:04:44,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:04:44,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:04:44,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:04:44,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:04:44,468 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:04:44,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:04:44,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:04:44,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:04:44,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:04:44,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:04:44,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:04:44,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:04:44,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:04:44,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:04:44,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:04:44,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:04:44,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:04:44,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:04:44,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:04:44,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:04:44,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:04:44,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5a3019657b4c9b0e8c0aa3e888313d420fe28d28 [2019-11-28 20:04:44,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:04:44,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:04:44,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:04:44,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:04:44,817 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:04:44,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2019-11-28 20:04:44,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04f1a38e/2ad44418b976419597086460896dd48a/FLAG4a6fad8cd [2019-11-28 20:04:45,396 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:04:45,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2019-11-28 20:04:45,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04f1a38e/2ad44418b976419597086460896dd48a/FLAG4a6fad8cd [2019-11-28 20:04:45,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04f1a38e/2ad44418b976419597086460896dd48a [2019-11-28 20:04:45,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:04:45,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:04:45,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:04:45,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:04:45,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:04:45,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45, skipping insertion in model container [2019-11-28 20:04:45,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:04:45,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:04:46,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:46,255 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:04:46,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:46,393 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:04:46,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46 WrapperNode [2019-11-28 20:04:46,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:04:46,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:04:46,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:04:46,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:04:46,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... [2019-11-28 20:04:46,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:04:46,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:04:46,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:04:46,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:04:46,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:04:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:04:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:04:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:04:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:04:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:04:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:04:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:04:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2019-11-28 20:04:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2019-11-28 20:04:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:04:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:04:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:04:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:04:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:04:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:04:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:04:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:04:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:04:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:04:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:04:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:04:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:04:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:04:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:04:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:04:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:04:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:04:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:04:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:04:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:04:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:04:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:04:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:04:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:04:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:04:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:04:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:04:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:04:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:04:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:04:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:04:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:04:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:04:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:04:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:04:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:04:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:04:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:04:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:04:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:04:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:04:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:04:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:04:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:04:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:04:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:04:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:04:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:04:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:04:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:04:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:04:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:04:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:04:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:04:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:04:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:04:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:04:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:04:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:04:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:04:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:04:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:04:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:04:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:04:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:04:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:04:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:04:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:04:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:04:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:04:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:04:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:04:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:04:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:04:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:04:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:04:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:04:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 20:04:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2019-11-28 20:04:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:04:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:04:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2019-11-28 20:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:04:47,087 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:04:47,087 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:04:47,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:47 BoogieIcfgContainer [2019-11-28 20:04:47,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:04:47,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:04:47,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:04:47,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:04:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:04:45" (1/3) ... [2019-11-28 20:04:47,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f3f6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:47, skipping insertion in model container [2019-11-28 20:04:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:46" (2/3) ... [2019-11-28 20:04:47,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f3f6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:47, skipping insertion in model container [2019-11-28 20:04:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:47" (3/3) ... [2019-11-28 20:04:47,101 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe.i [2019-11-28 20:04:47,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:04:47,122 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-28 20:04:47,134 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-28 20:04:47,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:04:47,166 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:04:47,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:04:47,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:04:47,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:04:47,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:04:47,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:04:47,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:04:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-28 20:04:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:47,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:47,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:47,204 INFO L410 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1361999972, now seen corresponding path program 1 times [2019-11-28 20:04:47,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:47,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518195211] [2019-11-28 20:04:47,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518195211] [2019-11-28 20:04:47,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:04:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386880646] [2019-11-28 20:04:47,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:04:47,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:04:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:47,462 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-28 20:04:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:47,713 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-11-28 20:04:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:47,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:04:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:47,728 INFO L225 Difference]: With dead ends: 71 [2019-11-28 20:04:47,728 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:04:47,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:04:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 20:04:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:04:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-11-28 20:04:47,780 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 11 [2019-11-28 20:04:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:47,781 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-11-28 20:04:47,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:04:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-11-28 20:04:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:47,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:47,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:47,782 INFO L410 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1361999971, now seen corresponding path program 1 times [2019-11-28 20:04:47,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:47,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499913427] [2019-11-28 20:04:47,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499913427] [2019-11-28 20:04:47,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:47,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361803940] [2019-11-28 20:04:47,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:47,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:47,909 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 5 states. [2019-11-28 20:04:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,077 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-28 20:04:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:48,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,079 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:04:48,080 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:04:48,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:04:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-28 20:04:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 20:04:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-11-28 20:04:48,091 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 11 [2019-11-28 20:04:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,091 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-11-28 20:04:48,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-11-28 20:04:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:48,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,094 INFO L410 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1361999918, now seen corresponding path program 1 times [2019-11-28 20:04:48,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947520272] [2019-11-28 20:04:48,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947520272] [2019-11-28 20:04:48,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:48,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587061752] [2019-11-28 20:04:48,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:48,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:48,180 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2019-11-28 20:04:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,322 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-11-28 20:04:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:48,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,326 INFO L225 Difference]: With dead ends: 73 [2019-11-28 20:04:48,327 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 20:04:48,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 20:04:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-11-28 20:04:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 20:04:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-11-28 20:04:48,339 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 11 [2019-11-28 20:04:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,340 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-11-28 20:04:48,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-11-28 20:04:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:48,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1361940336, now seen corresponding path program 1 times [2019-11-28 20:04:48,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90718257] [2019-11-28 20:04:48,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90718257] [2019-11-28 20:04:48,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:48,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:48,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686939641] [2019-11-28 20:04:48,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:48,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:48,470 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2019-11-28 20:04:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,695 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-11-28 20:04:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:48,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,697 INFO L225 Difference]: With dead ends: 77 [2019-11-28 20:04:48,697 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 20:04:48,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 20:04:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-11-28 20:04:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 20:04:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-11-28 20:04:48,706 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 11 [2019-11-28 20:04:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,706 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-11-28 20:04:48,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-11-28 20:04:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:04:48,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,708 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,708 INFO L410 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash 670453331, now seen corresponding path program 1 times [2019-11-28 20:04:48,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195441172] [2019-11-28 20:04:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195441172] [2019-11-28 20:04:48,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893416511] [2019-11-28 20:04:48,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:04:48,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:48,986 INFO L377 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 6 treesize of output 5 [2019-11-28 20:04:48,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:48,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:48,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:48,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:04:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:49,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:49,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-28 20:04:49,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595214884] [2019-11-28 20:04:49,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:04:49,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:04:49,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:49,033 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 7 states. [2019-11-28 20:04:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:49,284 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-11-28 20:04:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:49,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:04:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:49,288 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:04:49,289 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:04:49,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:04:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-28 20:04:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:04:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-11-28 20:04:49,297 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 15 [2019-11-28 20:04:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:49,298 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-11-28 20:04:49,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:04:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-11-28 20:04:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:04:49,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:49,300 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:49,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:49,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 140003118, now seen corresponding path program 1 times [2019-11-28 20:04:49,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:49,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951485241] [2019-11-28 20:04:49,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:49,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951485241] [2019-11-28 20:04:49,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596852552] [2019-11-28 20:04:49,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:04:49,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:49,984 INFO L377 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 6 treesize of output 5 [2019-11-28 20:04:49,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:49,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:49,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:49,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:04:50,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:50,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 20:04:50,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:50,089 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 20:04:50,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:04:50,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-28 20:04:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:50,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:50,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2019-11-28 20:04:50,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5553617] [2019-11-28 20:04:50,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:04:50,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:04:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:04:50,196 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 18 states. [2019-11-28 20:04:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:50,814 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-28 20:04:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:04:50,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-11-28 20:04:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:50,816 INFO L225 Difference]: With dead ends: 65 [2019-11-28 20:04:50,816 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 20:04:50,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:04:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 20:04:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 20:04:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:04:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-28 20:04:50,822 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2019-11-28 20:04:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:50,823 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-28 20:04:50,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:04:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-28 20:04:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:04:50,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:50,824 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:51,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:51,029 INFO L410 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 140003119, now seen corresponding path program 1 times [2019-11-28 20:04:51,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:51,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159836823] [2019-11-28 20:04:51,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159836823] [2019-11-28 20:04:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154539288] [2019-11-28 20:04:51,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-28 20:04:51,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:51,409 INFO L377 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 6 treesize of output 5 [2019-11-28 20:04:51,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:51,424 INFO L377 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 6 treesize of output 5 [2019-11-28 20:04:51,424 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:51,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,432 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-28 20:04:51,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:51,494 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:04:51,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:51,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 20:04:51,508 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:51,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:51,519 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-28 20:04:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:51,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:51,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2019-11-28 20:04:51,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060824417] [2019-11-28 20:04:51,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:04:51,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:04:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:04:51,525 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 16 states. [2019-11-28 20:04:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:52,247 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2019-11-28 20:04:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:04:52,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-28 20:04:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:52,251 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:04:52,251 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 20:04:52,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:04:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 20:04:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-11-28 20:04:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 20:04:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-28 20:04:52,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 28 [2019-11-28 20:04:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:52,259 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-28 20:04:52,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:04:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-28 20:04:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:04:52,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:52,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:52,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:52,470 INFO L410 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash 124645684, now seen corresponding path program 1 times [2019-11-28 20:04:52,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:52,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749831733] [2019-11-28 20:04:52,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:04:52,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749831733] [2019-11-28 20:04:52,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:52,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:04:52,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670303298] [2019-11-28 20:04:52,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:04:52,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:04:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:04:52,605 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 11 states. [2019-11-28 20:04:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:53,041 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-11-28 20:04:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:04:53,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-28 20:04:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:53,043 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:04:53,043 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:04:53,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:04:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:04:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-11-28 20:04:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:04:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-28 20:04:53,050 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 32 [2019-11-28 20:04:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:53,051 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-28 20:04:53,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:04:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-28 20:04:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:04:53,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:53,052 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:53,053 INFO L410 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash 124645685, now seen corresponding path program 1 times [2019-11-28 20:04:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:53,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476805236] [2019-11-28 20:04:53,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:04:53,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476805236] [2019-11-28 20:04:53,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:53,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:04:53,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360492414] [2019-11-28 20:04:53,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:04:53,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:04:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:04:53,239 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 12 states. [2019-11-28 20:04:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:53,866 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-11-28 20:04:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:04:53,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-28 20:04:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:53,869 INFO L225 Difference]: With dead ends: 125 [2019-11-28 20:04:53,869 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 20:04:53,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:04:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 20:04:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2019-11-28 20:04:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 20:04:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-11-28 20:04:53,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 32 [2019-11-28 20:04:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:53,887 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-11-28 20:04:53,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:04:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-11-28 20:04:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:04:53,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:53,896 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:53,897 INFO L410 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1155217993, now seen corresponding path program 1 times [2019-11-28 20:04:53,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:53,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849595994] [2019-11-28 20:04:53,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:04:54,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849595994] [2019-11-28 20:04:54,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:54,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:04:54,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796409322] [2019-11-28 20:04:54,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:04:54,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:04:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:04:54,151 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 13 states. [2019-11-28 20:04:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:54,656 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2019-11-28 20:04:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:04:54,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-11-28 20:04:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:54,658 INFO L225 Difference]: With dead ends: 124 [2019-11-28 20:04:54,658 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 20:04:54,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:04:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 20:04:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 70. [2019-11-28 20:04:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 20:04:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-11-28 20:04:54,663 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 32 [2019-11-28 20:04:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-11-28 20:04:54,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:04:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-11-28 20:04:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 20:04:54,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:54,665 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:54,665 INFO L410 AbstractCegarLoop]: === Iteration 11 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash -431506202, now seen corresponding path program 1 times [2019-11-28 20:04:54,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:54,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725597967] [2019-11-28 20:04:54,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:04:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:04:54,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:04:54,717 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:04:54,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:04:54 BoogieIcfgContainer [2019-11-28 20:04:54,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:04:54,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:04:54,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:04:54,751 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:04:54,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:47" (3/4) ... [2019-11-28 20:04:54,754 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:04:54,808 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:04:54,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:04:54,810 INFO L168 Benchmark]: Toolchain (without parser) took 9030.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.4 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -117.4 MB). Peak memory consumption was 161.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:54,811 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:04:54,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:54,812 INFO L168 Benchmark]: Boogie Preprocessor took 60.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:54,813 INFO L168 Benchmark]: RCFGBuilder took 634.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:54,814 INFO L168 Benchmark]: TraceAbstraction took 7657.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:54,814 INFO L168 Benchmark]: Witness Printer took 58.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:04:54,817 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 634.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7657.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. * Witness Printer took 58.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 548]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L546] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, malloc(length * sizeof(char))={-2:0}, nondetString={-2:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, malloc(length * sizeof(char))={-2:0}, nondetString={-2:0}] [L527] nondetString[length-1] = '\0' VAL [i=0, length=1, malloc(length * sizeof(char))={-2:0}, nondetString={-2:0}] [L528] return nondetString; VAL [\result={-2:0}, i=0, length=1, malloc(length * sizeof(char))={-2:0}, nondetString={-2:0}] [L546] RET, EXPR build_nondet_String() VAL [build_nondet_String()={-2:0}] [L546] char* s1 = build_nondet_String(); [L547] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L527] nondetString[length-1] = '\0' VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L528] return nondetString; VAL [\result={-1:0}, i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L547] RET, EXPR build_nondet_String() VAL [build_nondet_String()={-1:0}, s1={-2:0}] [L547] char* s2 = build_nondet_String(); [L548] CALL cstrpbrk(s1,s2) VAL [s1={-2:0}, s2={-1:0}] [L532] const char *sc1; [L533] const char *s; [L534] int c; [L535] sc1 = s1 VAL [s1={-2:0}, s1={-2:0}, s2={-1:0}, s2={-1:0}, sc1={-2:0}] [L535] EXPR \read(*sc1) VAL [\read(*sc1)=0, s1={-2:0}, s1={-2:0}, s2={-1:0}, s2={-1:0}, sc1={-2:0}] [L535] COND FALSE !(*sc1 != '\0') [L543] return 0; VAL [\result={0:0}, s1={-2:0}, s1={-2:0}, s2={-1:0}, s2={-1:0}, sc1={-2:0}] [L548] RET cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={-2:0}, s2={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 88 locations, 23 error locations. Result: UNSAFE, OverallTime: 7.5s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 486 SDtfs, 1225 SDslu, 958 SDs, 0 SdLazy, 2804 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 269 ConstructedInterpolants, 14 QuantifiedInterpolants, 41996 SizeOfPredicates, 19 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 39/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...