./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/rec_strlen-alloca-1.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 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 00:51:44,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 00:51:44,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 00:51:44,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 00:51:44,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 00:51:44,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 00:51:44,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 00:51:44,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 00:51:44,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 00:51:44,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 00:51:44,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 00:51:44,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 00:51:44,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 00:51:44,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 00:51:44,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 00:51:44,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 00:51:44,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 00:51:44,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 00:51:44,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 00:51:44,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 00:51:44,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 00:51:44,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 00:51:44,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 00:51:44,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 00:51:44,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 00:51:44,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 00:51:44,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 00:51:44,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 00:51:44,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 00:51:44,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 00:51:44,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 00:51:44,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 00:51:44,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 00:51:44,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 00:51:44,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 00:51:44,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 00:51:44,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 00:51:44,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 00:51:44,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 00:51:44,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 00:51:44,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 00:51:44,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 00:51:44,459 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 00:51:44,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 00:51:44,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 00:51:44,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 00:51:44,467 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 00:51:44,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 00:51:44,468 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 00:51:44,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 00:51:44,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 00:51:44,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 00:51:44,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 00:51:44,474 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 00:51:44,474 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 00:51:44,475 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 00:51:44,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 00:51:44,475 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 00:51:44,475 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 00:51:44,476 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 00:51:44,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 00:51:44,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 00:51:44,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 00:51:44,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 00:51:44,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 00:51:44,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 00:51:44,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 00:51:44,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 00:51:44,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 00:51:44,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 00:51:44,480 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 -> 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf [2020-07-29 00:51:44,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 00:51:44,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 00:51:44,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 00:51:44,843 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 00:51:44,845 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 00:51:44,846 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2020-07-29 00:51:44,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a615b81/2b3e4b2dff2444efab839ed6932c3c9c/FLAG593acd4f5 [2020-07-29 00:51:45,442 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 00:51:45,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2020-07-29 00:51:45,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a615b81/2b3e4b2dff2444efab839ed6932c3c9c/FLAG593acd4f5 [2020-07-29 00:51:45,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a615b81/2b3e4b2dff2444efab839ed6932c3c9c [2020-07-29 00:51:45,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 00:51:45,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 00:51:45,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 00:51:45,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 00:51:45,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 00:51:45,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:51:45" (1/1) ... [2020-07-29 00:51:45,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed5985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:45, skipping insertion in model container [2020-07-29 00:51:45,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:51:45" (1/1) ... [2020-07-29 00:51:45,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 00:51:45,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 00:51:46,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:51:46,279 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 00:51:46,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:51:46,403 INFO L208 MainTranslator]: Completed translation [2020-07-29 00:51:46,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46 WrapperNode [2020-07-29 00:51:46,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 00:51:46,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 00:51:46,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 00:51:46,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 00:51:46,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (1/1) ... [2020-07-29 00:51:46,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 00:51:46,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 00:51:46,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 00:51:46,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 00:51:46,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51: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 [2020-07-29 00:51:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 00:51:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 00:51:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 00:51:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 00:51:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 00:51:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 00:51:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 00:51:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2020-07-29 00:51:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 00:51:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 00:51:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 00:51:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 00:51:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 00:51:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 00:51:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 00:51:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 00:51:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 00:51:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 00:51:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 00:51:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 00:51:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 00:51:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 00:51:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 00:51:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 00:51:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 00:51:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 00:51:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 00:51:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 00:51:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 00:51:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 00:51:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 00:51:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 00:51:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 00:51:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 00:51:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 00:51:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 00:51:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 00:51:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 00:51:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 00:51:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 00:51:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 00:51:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 00:51:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 00:51:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 00:51:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 00:51:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 00:51:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 00:51:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 00:51:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 00:51:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 00:51:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 00:51:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 00:51:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 00:51:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 00:51:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 00:51:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 00:51:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 00:51:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 00:51:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 00:51:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 00:51:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 00:51:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 00:51:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 00:51:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 00:51:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 00:51:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 00:51:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 00:51:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 00:51:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 00:51:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 00:51:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 00:51:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 00:51:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 00:51:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 00:51:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 00:51:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 00:51:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 00:51:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 00:51:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 00:51:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 00:51:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 00:51:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 00:51:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 00:51:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 00:51:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 00:51:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 00:51:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 00:51:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 00:51:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 00:51:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 00:51:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 00:51:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 00:51:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 00:51:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 00:51:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 00:51:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 00:51:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 00:51:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 00:51:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 00:51:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 00:51:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 00:51:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 00:51:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-29 00:51:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2020-07-29 00:51:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 00:51:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 00:51:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 00:51:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 00:51:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 00:51:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 00:51:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 00:51:47,243 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 00:51:47,243 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 00:51:47,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:51:47 BoogieIcfgContainer [2020-07-29 00:51:47,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 00:51:47,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 00:51:47,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 00:51:47,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 00:51:47,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 12:51:45" (1/3) ... [2020-07-29 00:51:47,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a9f30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:51:47, skipping insertion in model container [2020-07-29 00:51:47,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:51:46" (2/3) ... [2020-07-29 00:51:47,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a9f30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:51:47, skipping insertion in model container [2020-07-29 00:51:47,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:51:47" (3/3) ... [2020-07-29 00:51:47,256 INFO L109 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2020-07-29 00:51:47,268 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 00:51:47,276 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-07-29 00:51:47,291 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-07-29 00:51:47,313 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 00:51:47,313 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 00:51:47,313 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 00:51:47,314 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 00:51:47,314 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 00:51:47,315 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 00:51:47,315 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 00:51:47,315 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 00:51:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-29 00:51:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:51:47,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:47,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:47,342 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754822, now seen corresponding path program 1 times [2020-07-29 00:51:47,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:47,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9131951] [2020-07-29 00:51:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:47,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:47,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-29 00:51:47,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 00:51:47,596 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #63#return; {36#true} is VALID [2020-07-29 00:51:47,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:47,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-29 00:51:47,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 00:51:47,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #63#return; {36#true} is VALID [2020-07-29 00:51:47,603 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret9 := main(); {36#true} is VALID [2020-07-29 00:51:47,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {36#true} is VALID [2020-07-29 00:51:47,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~length1~0 < 1;~length1~0 := 1; {36#true} is VALID [2020-07-29 00:51:47,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {41#(= 1 (select |#valid| main_~nondetString1~0.base))} is VALID [2020-07-29 00:51:47,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#(= 1 (select |#valid| main_~nondetString1~0.base))} assume !(~i~0 < ~length1~0 - 1); {41#(= 1 (select |#valid| main_~nondetString1~0.base))} is VALID [2020-07-29 00:51:47,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= 1 (select |#valid| main_~nondetString1~0.base))} assume !(1 == #valid[~nondetString1~0.base]); {37#false} is VALID [2020-07-29 00:51:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:47,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9131951] [2020-07-29 00:51:47,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:47,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:51:47,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418081664] [2020-07-29 00:51:47,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 00:51:47,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:47,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:51:47,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:47,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:51:47,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:51:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:51:47,659 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-29 00:51:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:47,897 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-29 00:51:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:51:47,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 00:51:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:51:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 00:51:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:51:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 00:51:47,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-29 00:51:47,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:48,001 INFO L225 Difference]: With dead ends: 31 [2020-07-29 00:51:48,001 INFO L226 Difference]: Without dead ends: 28 [2020-07-29 00:51:48,003 INFO L675 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 [2020-07-29 00:51:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-29 00:51:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-29 00:51:48,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:48,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-29 00:51:48,042 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-29 00:51:48,042 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-29 00:51:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,048 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-29 00:51:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-29 00:51:48,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,050 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-29 00:51:48,050 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-29 00:51:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,055 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-29 00:51:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-29 00:51:48,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:48,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 00:51:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-29 00:51:48,065 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2020-07-29 00:51:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:48,068 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-29 00:51:48,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:51:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-29 00:51:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:51:48,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:48,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:48,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 00:51:48,070 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754821, now seen corresponding path program 1 times [2020-07-29 00:51:48,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:48,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066039697] [2020-07-29 00:51:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:48,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:48,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {160#true} is VALID [2020-07-29 00:51:48,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2020-07-29 00:51:48,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #63#return; {160#true} is VALID [2020-07-29 00:51:48,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:48,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {160#true} is VALID [2020-07-29 00:51:48,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2020-07-29 00:51:48,211 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #63#return; {160#true} is VALID [2020-07-29 00:51:48,212 INFO L263 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret9 := main(); {160#true} is VALID [2020-07-29 00:51:48,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {160#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {160#true} is VALID [2020-07-29 00:51:48,213 INFO L280 TraceCheckUtils]: 6: Hoare triple {160#true} assume ~length1~0 < 1;~length1~0 := 1; {165#(<= 1 main_~length1~0)} is VALID [2020-07-29 00:51:48,215 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(<= 1 main_~length1~0)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {166#(and (<= 1 main_~length1~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:48,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {166#(and (<= 1 main_~length1~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {166#(and (<= 1 main_~length1~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:48,218 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#(and (<= 1 main_~length1~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !(1 + (~nondetString1~0.offset + (~length1~0 - 1)) <= #length[~nondetString1~0.base] && 0 <= ~nondetString1~0.offset + (~length1~0 - 1)); {161#false} is VALID [2020-07-29 00:51:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:48,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066039697] [2020-07-29 00:51:48,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:48,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 00:51:48,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600886258] [2020-07-29 00:51:48,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:48,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:48,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:51:48,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:48,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:51:48,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:51:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:51:48,242 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-29 00:51:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,430 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 00:51:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:51:48,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-29 00:51:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-29 00:51:48,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-29 00:51:48,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:48,491 INFO L225 Difference]: With dead ends: 27 [2020-07-29 00:51:48,491 INFO L226 Difference]: Without dead ends: 27 [2020-07-29 00:51:48,492 INFO L675 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 [2020-07-29 00:51:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-29 00:51:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-29 00:51:48,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:48,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-29 00:51:48,497 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-29 00:51:48,497 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-29 00:51:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,501 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 00:51:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 00:51:48,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,503 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-29 00:51:48,503 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-29 00:51:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,507 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 00:51:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 00:51:48,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:48,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 00:51:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-29 00:51:48,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2020-07-29 00:51:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:48,514 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 00:51:48,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:51:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 00:51:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:51:48,515 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:48,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:48,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 00:51:48,516 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754768, now seen corresponding path program 1 times [2020-07-29 00:51:48,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:48,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912801147] [2020-07-29 00:51:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:48,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:48,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {280#true} is VALID [2020-07-29 00:51:48,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {280#true} assume true; {280#true} is VALID [2020-07-29 00:51:48,613 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {280#true} {280#true} #63#return; {280#true} is VALID [2020-07-29 00:51:48,614 INFO L263 TraceCheckUtils]: 0: Hoare triple {280#true} call ULTIMATE.init(); {287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:48,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {280#true} is VALID [2020-07-29 00:51:48,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {280#true} assume true; {280#true} is VALID [2020-07-29 00:51:48,616 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {280#true} {280#true} #63#return; {280#true} is VALID [2020-07-29 00:51:48,616 INFO L263 TraceCheckUtils]: 4: Hoare triple {280#true} call #t~ret9 := main(); {280#true} is VALID [2020-07-29 00:51:48,616 INFO L280 TraceCheckUtils]: 5: Hoare triple {280#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {280#true} is VALID [2020-07-29 00:51:48,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {280#true} assume ~length1~0 < 1;~length1~0 := 1; {285#(<= main_~length1~0 1)} is VALID [2020-07-29 00:51:48,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {285#(<= main_~length1~0 1)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {286#(and (= 0 main_~i~0) (<= main_~length1~0 1))} is VALID [2020-07-29 00:51:48,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {286#(and (= 0 main_~i~0) (<= main_~length1~0 1))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {281#false} is VALID [2020-07-29 00:51:48,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {281#false} assume !(1 + (~nondetString1~0.offset + ~i~0) <= #length[~nondetString1~0.base] && 0 <= ~nondetString1~0.offset + ~i~0); {281#false} is VALID [2020-07-29 00:51:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:48,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912801147] [2020-07-29 00:51:48,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:48,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:51:48,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056392864] [2020-07-29 00:51:48,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:48,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:48,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:51:48,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:48,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:51:48,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:51:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:51:48,643 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2020-07-29 00:51:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,878 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 00:51:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:51:48,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-29 00:51:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-29 00:51:48,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-29 00:51:48,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:48,980 INFO L225 Difference]: With dead ends: 34 [2020-07-29 00:51:48,980 INFO L226 Difference]: Without dead ends: 34 [2020-07-29 00:51:48,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:51:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-29 00:51:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-07-29 00:51:48,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:48,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2020-07-29 00:51:48,985 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2020-07-29 00:51:48,985 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2020-07-29 00:51:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,989 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 00:51:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-29 00:51:48,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,991 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2020-07-29 00:51:48,991 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2020-07-29 00:51:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:48,995 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 00:51:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-29 00:51:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:48,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:48,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:48,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 00:51:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-29 00:51:48,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2020-07-29 00:51:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:48,999 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-29 00:51:49,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:51:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 00:51:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:51:49,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:49,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:49,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 00:51:49,001 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2117695186, now seen corresponding path program 1 times [2020-07-29 00:51:49,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:49,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047547568] [2020-07-29 00:51:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:49,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:49,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {423#true} is VALID [2020-07-29 00:51:49,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2020-07-29 00:51:49,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #63#return; {423#true} is VALID [2020-07-29 00:51:49,092 INFO L263 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {430#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:49,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {423#true} is VALID [2020-07-29 00:51:49,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2020-07-29 00:51:49,093 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #63#return; {423#true} is VALID [2020-07-29 00:51:49,094 INFO L263 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret9 := main(); {423#true} is VALID [2020-07-29 00:51:49,094 INFO L280 TraceCheckUtils]: 5: Hoare triple {423#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {423#true} is VALID [2020-07-29 00:51:49,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {423#true} assume !(~length1~0 < 1); {428#(<= 1 main_~length1~0)} is VALID [2020-07-29 00:51:49,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {428#(<= 1 main_~length1~0)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {429#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:49,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {429#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {429#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:49,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {429#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} assume !(1 + (~nondetString1~0.offset + ~i~0) <= #length[~nondetString1~0.base] && 0 <= ~nondetString1~0.offset + ~i~0); {424#false} is VALID [2020-07-29 00:51:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:49,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047547568] [2020-07-29 00:51:49,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:49,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 00:51:49,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636289127] [2020-07-29 00:51:49,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:49,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:49,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:51:49,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:49,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:51:49,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:49,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:51:49,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:51:49,114 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2020-07-29 00:51:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:49,426 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 00:51:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:51:49,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-29 00:51:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-29 00:51:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-29 00:51:49,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-29 00:51:49,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:49,507 INFO L225 Difference]: With dead ends: 38 [2020-07-29 00:51:49,507 INFO L226 Difference]: Without dead ends: 38 [2020-07-29 00:51:49,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 00:51:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-29 00:51:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-29 00:51:49,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:49,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 31 states. [2020-07-29 00:51:49,512 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 31 states. [2020-07-29 00:51:49,513 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 31 states. [2020-07-29 00:51:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:49,516 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 00:51:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-29 00:51:49,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:49,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:49,517 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states. [2020-07-29 00:51:49,518 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states. [2020-07-29 00:51:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:49,545 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 00:51:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-29 00:51:49,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:49,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:49,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:49,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 00:51:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 00:51:49,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2020-07-29 00:51:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:49,549 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 00:51:49,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:51:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-29 00:51:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 00:51:49,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:49,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:49,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 00:51:49,551 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1259263901, now seen corresponding path program 1 times [2020-07-29 00:51:49,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:49,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601846498] [2020-07-29 00:51:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:49,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:49,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {582#true} is VALID [2020-07-29 00:51:49,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2020-07-29 00:51:49,639 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #63#return; {582#true} is VALID [2020-07-29 00:51:49,640 INFO L263 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {590#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:49,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {582#true} is VALID [2020-07-29 00:51:49,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2020-07-29 00:51:49,640 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #63#return; {582#true} is VALID [2020-07-29 00:51:49,641 INFO L263 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret9 := main(); {582#true} is VALID [2020-07-29 00:51:49,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {582#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2020-07-29 00:51:49,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {582#true} assume ~length1~0 < 1;~length1~0 := 1; {582#true} is VALID [2020-07-29 00:51:49,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {582#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {582#true} is VALID [2020-07-29 00:51:49,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {582#true} assume !(~i~0 < ~length1~0 - 1); {582#true} is VALID [2020-07-29 00:51:49,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {582#true} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {587#(= 1 (select |#valid| main_~nondetString1~0.base))} is VALID [2020-07-29 00:51:49,644 INFO L263 TraceCheckUtils]: 10: Hoare triple {587#(= 1 (select |#valid| main_~nondetString1~0.base))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {588#(= 1 (select |#valid| |strlen_rec_#in~p.base|))} is VALID [2020-07-29 00:51:49,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#(= 1 (select |#valid| |strlen_rec_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {589#(= 1 (select |#valid| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:49,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {589#(= 1 (select |#valid| strlen_rec_~p.base))} assume !(1 == #valid[~p.base]); {583#false} is VALID [2020-07-29 00:51:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:49,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601846498] [2020-07-29 00:51:49,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:49,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:51:49,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509443804] [2020-07-29 00:51:49,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-29 00:51:49,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:49,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:51:49,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:49,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:51:49,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:51:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:51:49,674 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-07-29 00:51:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:49,961 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 00:51:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:51:49,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-29 00:51:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:51:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-29 00:51:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:51:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-29 00:51:49,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2020-07-29 00:51:50,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:50,016 INFO L225 Difference]: With dead ends: 30 [2020-07-29 00:51:50,017 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 00:51:50,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:51:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 00:51:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-29 00:51:50,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:50,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-29 00:51:50,021 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 00:51:50,021 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 00:51:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:50,023 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 00:51:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 00:51:50,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:50,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:50,024 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 00:51:50,024 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 00:51:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:50,026 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 00:51:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 00:51:50,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:50,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:50,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:50,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 00:51:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-29 00:51:50,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2020-07-29 00:51:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:50,030 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-29 00:51:50,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:51:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 00:51:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 00:51:50,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:50,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:50,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 00:51:50,032 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1259263900, now seen corresponding path program 1 times [2020-07-29 00:51:50,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:50,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130432174] [2020-07-29 00:51:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {717#true} is VALID [2020-07-29 00:51:50,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-29 00:51:50,147 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {717#true} {717#true} #63#return; {717#true} is VALID [2020-07-29 00:51:50,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {717#true} call ULTIMATE.init(); {726#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:50,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {726#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {717#true} is VALID [2020-07-29 00:51:50,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-29 00:51:50,149 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {717#true} {717#true} #63#return; {717#true} is VALID [2020-07-29 00:51:50,149 INFO L263 TraceCheckUtils]: 4: Hoare triple {717#true} call #t~ret9 := main(); {717#true} is VALID [2020-07-29 00:51:50,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {717#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {717#true} is VALID [2020-07-29 00:51:50,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {717#true} assume ~length1~0 < 1;~length1~0 := 1; {722#(<= 1 main_~length1~0)} is VALID [2020-07-29 00:51:50,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(<= 1 main_~length1~0)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:50,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} assume !(~i~0 < ~length1~0 - 1); {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:50,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:50,154 INFO L263 TraceCheckUtils]: 10: Hoare triple {723#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {724#(and (<= 1 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:50,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {724#(and (<= 1 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {725#(and (= 0 strlen_rec_~p.offset) (<= 1 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:50,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {725#(and (= 0 strlen_rec_~p.offset) (<= 1 (select |#length| strlen_rec_~p.base)))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {718#false} is VALID [2020-07-29 00:51:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:50,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130432174] [2020-07-29 00:51:50,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:50,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 00:51:50,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286150035] [2020-07-29 00:51:50,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-29 00:51:50,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:50,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 00:51:50,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:50,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 00:51:50,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 00:51:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 00:51:50,175 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2020-07-29 00:51:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:50,614 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 00:51:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 00:51:50,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-29 00:51:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:51:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-29 00:51:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:51:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-29 00:51:50,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2020-07-29 00:51:50,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:50,682 INFO L225 Difference]: With dead ends: 37 [2020-07-29 00:51:50,682 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 00:51:50,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-29 00:51:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 00:51:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-29 00:51:50,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:50,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-29 00:51:50,687 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-29 00:51:50,687 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-29 00:51:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:50,689 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 00:51:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:51:50,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:50,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:50,690 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-29 00:51:50,690 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-29 00:51:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:50,693 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 00:51:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:51:50,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:50,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:50,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:50,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 00:51:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-29 00:51:50,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 13 [2020-07-29 00:51:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:50,696 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-29 00:51:50,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 00:51:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:51:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 00:51:50,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:50,697 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:50,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 00:51:50,697 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1143813903, now seen corresponding path program 1 times [2020-07-29 00:51:50,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:50,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71209298] [2020-07-29 00:51:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-29 00:51:50,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-29 00:51:50,840 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} #63#return; {885#true} is VALID [2020-07-29 00:51:50,841 INFO L263 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:50,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-29 00:51:50,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-29 00:51:50,842 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #63#return; {885#true} is VALID [2020-07-29 00:51:50,842 INFO L263 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret9 := main(); {885#true} is VALID [2020-07-29 00:51:50,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {885#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {885#true} is VALID [2020-07-29 00:51:50,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {885#true} assume !(~length1~0 < 1); {885#true} is VALID [2020-07-29 00:51:50,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {885#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:50,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:50,845 INFO L280 TraceCheckUtils]: 9: Hoare triple {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:50,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:50,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {890#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {891#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:51:50,848 INFO L280 TraceCheckUtils]: 12: Hoare triple {891#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {892#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0) (<= (+ main_~i~0 2) (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:50,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {892#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0) (<= (+ main_~i~0 2) (select |#length| main_~nondetString1~0.base)))} assume !(1 + (~nondetString1~0.offset + ~i~0) <= #length[~nondetString1~0.base] && 0 <= ~nondetString1~0.offset + ~i~0); {886#false} is VALID [2020-07-29 00:51:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:50,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71209298] [2020-07-29 00:51:50,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040731375] [2020-07-29 00:51:50,851 INFO L95 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 [2020-07-29 00:51:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 00:51:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:50,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:51:51,077 INFO L384 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 [2020-07-29 00:51:51,078 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:51:51,086 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:51:51,087 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:51:51,087 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 00:51:51,093 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:51:51,093 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_11|]. (and (<= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (= |#length| (store |v_#length_11| main_~nondetString1~0.base main_~length1~0))) [2020-07-29 00:51:51,093 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset)) [2020-07-29 00:51:51,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2020-07-29 00:51:51,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-29 00:51:51,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-29 00:51:51,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #63#return; {885#true} is VALID [2020-07-29 00:51:51,203 INFO L263 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret9 := main(); {885#true} is VALID [2020-07-29 00:51:51,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {885#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {885#true} is VALID [2020-07-29 00:51:51,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {885#true} assume !(~length1~0 < 1); {885#true} is VALID [2020-07-29 00:51:51,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {885#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:51,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:51,207 INFO L280 TraceCheckUtils]: 9: Hoare triple {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:51,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:51,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {918#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {891#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:51:51,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {891#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {892#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0) (<= (+ main_~i~0 2) (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:51:51,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {892#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0) (<= (+ main_~i~0 2) (select |#length| main_~nondetString1~0.base)))} assume !(1 + (~nondetString1~0.offset + ~i~0) <= #length[~nondetString1~0.base] && 0 <= ~nondetString1~0.offset + ~i~0); {886#false} is VALID [2020-07-29 00:51:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:51,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:51:51,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-29 00:51:51,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343402523] [2020-07-29 00:51:51,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-29 00:51:51,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:51,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 00:51:51,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:51,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 00:51:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 00:51:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 00:51:51,240 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2020-07-29 00:51:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:51,608 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-29 00:51:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:51:51,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-29 00:51:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:51:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-29 00:51:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:51:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-29 00:51:51,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-29 00:51:51,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:51,675 INFO L225 Difference]: With dead ends: 43 [2020-07-29 00:51:51,675 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 00:51:51,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:51:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 00:51:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2020-07-29 00:51:51,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:51,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 34 states. [2020-07-29 00:51:51,686 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 34 states. [2020-07-29 00:51:51,686 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 34 states. [2020-07-29 00:51:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:51,691 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-29 00:51:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-29 00:51:51,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:51,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:51,694 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 43 states. [2020-07-29 00:51:51,695 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 43 states. [2020-07-29 00:51:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:51,700 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-29 00:51:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-29 00:51:51,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:51,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:51,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:51,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 00:51:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-29 00:51:51,708 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2020-07-29 00:51:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:51,709 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-29 00:51:51,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 00:51:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-29 00:51:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 00:51:51,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:51,712 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:51,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-29 00:51:51,928 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash 228211982, now seen corresponding path program 1 times [2020-07-29 00:51:51,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:51,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429887643] [2020-07-29 00:51:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:52,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:52,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {1112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1101#true} is VALID [2020-07-29 00:51:52,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {1101#true} assume true; {1101#true} is VALID [2020-07-29 00:51:52,170 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1101#true} {1101#true} #63#return; {1101#true} is VALID [2020-07-29 00:51:52,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {1101#true} call ULTIMATE.init(); {1112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:52,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {1112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1101#true} is VALID [2020-07-29 00:51:52,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {1101#true} assume true; {1101#true} is VALID [2020-07-29 00:51:52,172 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1101#true} {1101#true} #63#return; {1101#true} is VALID [2020-07-29 00:51:52,172 INFO L263 TraceCheckUtils]: 4: Hoare triple {1101#true} call #t~ret9 := main(); {1101#true} is VALID [2020-07-29 00:51:52,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {1101#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1101#true} is VALID [2020-07-29 00:51:52,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {1101#true} assume ~length1~0 < 1;~length1~0 := 1; {1106#(and (<= 1 main_~length1~0) (<= main_~length1~0 1))} is VALID [2020-07-29 00:51:52,191 INFO L280 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= 1 main_~length1~0) (<= main_~length1~0 1))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1107#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:52,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {1107#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {1107#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:52,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {1107#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1108#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:52,199 INFO L263 TraceCheckUtils]: 10: Hoare triple {1108#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1109#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:52,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {1109#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1110#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:52,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {1110#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1111#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:51:52,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {1111#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {1102#false} is VALID [2020-07-29 00:51:52,202 INFO L263 TraceCheckUtils]: 14: Hoare triple {1102#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1102#false} is VALID [2020-07-29 00:51:52,203 INFO L280 TraceCheckUtils]: 15: Hoare triple {1102#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1102#false} is VALID [2020-07-29 00:51:52,203 INFO L280 TraceCheckUtils]: 16: Hoare triple {1102#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1102#false} is VALID [2020-07-29 00:51:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:52,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429887643] [2020-07-29 00:51:52,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:52,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 00:51:52,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275791260] [2020-07-29 00:51:52,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 00:51:52,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:52,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 00:51:52,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:52,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 00:51:52,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 00:51:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-29 00:51:52,231 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 9 states. [2020-07-29 00:51:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:52,756 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 00:51:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 00:51:52,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 00:51:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 00:51:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-29 00:51:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 00:51:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-29 00:51:52,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2020-07-29 00:51:52,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:52,825 INFO L225 Difference]: With dead ends: 44 [2020-07-29 00:51:52,825 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 00:51:52,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-29 00:51:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 00:51:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-29 00:51:52,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:52,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-29 00:51:52,830 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-29 00:51:52,830 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-29 00:51:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:52,833 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 00:51:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 00:51:52,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:52,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:52,833 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-29 00:51:52,834 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-29 00:51:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:52,836 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 00:51:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 00:51:52,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:52,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:52,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:52,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 00:51:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-29 00:51:52,839 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2020-07-29 00:51:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:52,839 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-29 00:51:52,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 00:51:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-29 00:51:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 00:51:52,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:52,840 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:52,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 00:51:52,840 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:52,841 INFO L82 PathProgramCache]: Analyzing trace with hash 929276560, now seen corresponding path program 1 times [2020-07-29 00:51:52,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:52,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900203019] [2020-07-29 00:51:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:53,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:53,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1298#true} is VALID [2020-07-29 00:51:53,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {1298#true} assume true; {1298#true} is VALID [2020-07-29 00:51:53,086 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1298#true} {1298#true} #63#return; {1298#true} is VALID [2020-07-29 00:51:53,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {1298#true} call ULTIMATE.init(); {1310#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:53,089 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1298#true} is VALID [2020-07-29 00:51:53,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {1298#true} assume true; {1298#true} is VALID [2020-07-29 00:51:53,090 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} #63#return; {1298#true} is VALID [2020-07-29 00:51:53,090 INFO L263 TraceCheckUtils]: 4: Hoare triple {1298#true} call #t~ret9 := main(); {1298#true} is VALID [2020-07-29 00:51:53,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {1298#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1298#true} is VALID [2020-07-29 00:51:53,093 INFO L280 TraceCheckUtils]: 6: Hoare triple {1298#true} assume !(~length1~0 < 1); {1303#(<= 1 main_~length1~0)} is VALID [2020-07-29 00:51:53,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {1303#(<= 1 main_~length1~0)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1304#(and (or (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (and (<= 1 main_~length1~0) (= 0 main_~i~0))) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:53,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {1304#(and (or (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (and (<= 1 main_~length1~0) (= 0 main_~i~0))) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {1305#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:53,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1306#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:53,104 INFO L263 TraceCheckUtils]: 10: Hoare triple {1306#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1307#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:53,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1308#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:53,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {1308#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1309#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:51:53,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {1309#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {1299#false} is VALID [2020-07-29 00:51:53,107 INFO L263 TraceCheckUtils]: 14: Hoare triple {1299#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1299#false} is VALID [2020-07-29 00:51:53,108 INFO L280 TraceCheckUtils]: 15: Hoare triple {1299#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1299#false} is VALID [2020-07-29 00:51:53,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {1299#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1299#false} is VALID [2020-07-29 00:51:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:53,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900203019] [2020-07-29 00:51:53,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:53,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 00:51:53,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743850863] [2020-07-29 00:51:53,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 00:51:53,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:53,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 00:51:53,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:53,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 00:51:53,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 00:51:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-29 00:51:53,131 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2020-07-29 00:51:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:53,703 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 00:51:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 00:51:53,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 00:51:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 00:51:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2020-07-29 00:51:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 00:51:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2020-07-29 00:51:53,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2020-07-29 00:51:53,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:53,779 INFO L225 Difference]: With dead ends: 55 [2020-07-29 00:51:53,779 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 00:51:53,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-29 00:51:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 00:51:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-07-29 00:51:53,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:53,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2020-07-29 00:51:53,785 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2020-07-29 00:51:53,785 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2020-07-29 00:51:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:53,788 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 00:51:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 00:51:53,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:53,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:53,789 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2020-07-29 00:51:53,789 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2020-07-29 00:51:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:53,791 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 00:51:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 00:51:53,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:53,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:53,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:53,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 00:51:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-29 00:51:53,795 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 17 [2020-07-29 00:51:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:53,795 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-29 00:51:53,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 00:51:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-29 00:51:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 00:51:53,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:53,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:53,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 00:51:53,796 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1516451273, now seen corresponding path program 1 times [2020-07-29 00:51:53,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:53,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305035116] [2020-07-29 00:51:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:53,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:53,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {1542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1530#true} is VALID [2020-07-29 00:51:53,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-29 00:51:53,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #63#return; {1530#true} is VALID [2020-07-29 00:51:53,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-07-29 00:51:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:53,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1530#true} is VALID [2020-07-29 00:51:53,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1530#true} is VALID [2020-07-29 00:51:53,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {1530#true} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {1530#true} is VALID [2020-07-29 00:51:53,873 INFO L280 TraceCheckUtils]: 3: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-29 00:51:53,875 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1530#true} {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} #59#return; {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} is VALID [2020-07-29 00:51:53,876 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:53,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {1542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1530#true} is VALID [2020-07-29 00:51:53,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-29 00:51:53,877 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #63#return; {1530#true} is VALID [2020-07-29 00:51:53,877 INFO L263 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret9 := main(); {1535#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:51:53,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {1535#(= |#valid| |old(#valid)|)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1535#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:51:53,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {1535#(= |#valid| |old(#valid)|)} assume ~length1~0 < 1;~length1~0 := 1; {1535#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:51:53,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {1535#(= |#valid| |old(#valid)|)} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} is VALID [2020-07-29 00:51:53,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} assume !(~i~0 < ~length1~0 - 1); {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} is VALID [2020-07-29 00:51:53,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} is VALID [2020-07-29 00:51:53,881 INFO L263 TraceCheckUtils]: 10: Hoare triple {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1530#true} is VALID [2020-07-29 00:51:53,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {1530#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1530#true} is VALID [2020-07-29 00:51:53,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {1530#true} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1530#true} is VALID [2020-07-29 00:51:53,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {1530#true} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {1530#true} is VALID [2020-07-29 00:51:53,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-29 00:51:53,883 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1530#true} {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} #59#return; {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} is VALID [2020-07-29 00:51:53,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {1536#(= (store |#valid| |main_#t~malloc5.base| 0) |old(#valid)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8;call ULTIMATE.dealloc(#t~malloc5.base, #t~malloc5.offset);havoc #t~malloc5.base, #t~malloc5.offset; {1535#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:51:53,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {1535#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1531#false} is VALID [2020-07-29 00:51:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:53,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305035116] [2020-07-29 00:51:53,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:51:53,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 00:51:53,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908392711] [2020-07-29 00:51:53,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 00:51:53,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:53,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:51:53,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:53,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:51:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:51:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:51:53,908 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2020-07-29 00:51:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:54,064 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-29 00:51:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:51:54,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 00:51:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-07-29 00:51:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:51:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-07-29 00:51:54,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2020-07-29 00:51:54,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:54,100 INFO L225 Difference]: With dead ends: 41 [2020-07-29 00:51:54,100 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 00:51:54,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:51:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 00:51:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-29 00:51:54,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:54,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2020-07-29 00:51:54,103 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2020-07-29 00:51:54,104 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2020-07-29 00:51:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:54,105 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 00:51:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 00:51:54,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:54,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:54,106 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2020-07-29 00:51:54,106 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2020-07-29 00:51:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:54,107 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 00:51:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 00:51:54,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:54,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:54,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:54,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:51:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-29 00:51:54,110 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2020-07-29 00:51:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:54,110 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-29 00:51:54,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:51:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-29 00:51:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 00:51:54,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:54,111 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:54,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 00:51:54,112 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1650962797, now seen corresponding path program 1 times [2020-07-29 00:51:54,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:54,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633073594] [2020-07-29 00:51:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:54,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:54,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {1667#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1656#true} is VALID [2020-07-29 00:51:54,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {1656#true} assume true; {1656#true} is VALID [2020-07-29 00:51:54,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1656#true} {1656#true} #63#return; {1656#true} is VALID [2020-07-29 00:51:54,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {1656#true} call ULTIMATE.init(); {1667#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:54,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {1667#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1656#true} is VALID [2020-07-29 00:51:54,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {1656#true} assume true; {1656#true} is VALID [2020-07-29 00:51:54,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1656#true} {1656#true} #63#return; {1656#true} is VALID [2020-07-29 00:51:54,278 INFO L263 TraceCheckUtils]: 4: Hoare triple {1656#true} call #t~ret9 := main(); {1656#true} is VALID [2020-07-29 00:51:54,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {1656#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1656#true} is VALID [2020-07-29 00:51:54,279 INFO L280 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !(~length1~0 < 1); {1656#true} is VALID [2020-07-29 00:51:54,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {1656#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1661#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {1661#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:54,287 INFO L263 TraceCheckUtils]: 14: Hoare triple {1662#(and (<= 2 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1663#(and (<= 2 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:54,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {1663#(and (<= 2 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:54,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:54,289 INFO L280 TraceCheckUtils]: 17: Hoare triple {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:54,290 INFO L263 TraceCheckUtils]: 18: Hoare triple {1664#(and (<= 2 (select |#length| strlen_rec_~p.base)) (= 0 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1665#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:51:54,291 INFO L280 TraceCheckUtils]: 19: Hoare triple {1665#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1666#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:54,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {1666#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1657#false} is VALID [2020-07-29 00:51:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:54,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633073594] [2020-07-29 00:51:54,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766276656] [2020-07-29 00:51:54,294 INFO L95 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 [2020-07-29 00:51:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:54,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-29 00:51:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:54,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:51:54,637 INFO L263 TraceCheckUtils]: 0: Hoare triple {1656#true} call ULTIMATE.init(); {1656#true} is VALID [2020-07-29 00:51:54,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {1656#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1656#true} is VALID [2020-07-29 00:51:54,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {1656#true} assume true; {1656#true} is VALID [2020-07-29 00:51:54,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1656#true} {1656#true} #63#return; {1656#true} is VALID [2020-07-29 00:51:54,639 INFO L263 TraceCheckUtils]: 4: Hoare triple {1656#true} call #t~ret9 := main(); {1656#true} is VALID [2020-07-29 00:51:54,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {1656#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1656#true} is VALID [2020-07-29 00:51:54,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !(~length1~0 < 1); {1656#true} is VALID [2020-07-29 00:51:54,644 INFO L280 TraceCheckUtils]: 7: Hoare triple {1656#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1692#(<= 0 main_~i~0)} is VALID [2020-07-29 00:51:54,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {1692#(<= 0 main_~i~0)} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {1696#(<= 2 main_~length1~0)} is VALID [2020-07-29 00:51:54,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {1696#(<= 2 main_~length1~0)} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {1696#(<= 2 main_~length1~0)} is VALID [2020-07-29 00:51:54,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {1696#(<= 2 main_~length1~0)} havoc #t~nondet7; {1696#(<= 2 main_~length1~0)} is VALID [2020-07-29 00:51:54,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {1696#(<= 2 main_~length1~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1696#(<= 2 main_~length1~0)} is VALID [2020-07-29 00:51:54,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {1696#(<= 2 main_~length1~0)} assume !(~i~0 < ~length1~0 - 1); {1696#(<= 2 main_~length1~0)} is VALID [2020-07-29 00:51:54,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {1696#(<= 2 main_~length1~0)} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1712#(<= (+ main_~nondetString1~0.offset 2) (select |#length| main_~nondetString1~0.base))} is VALID [2020-07-29 00:51:54,658 INFO L263 TraceCheckUtils]: 14: Hoare triple {1712#(<= (+ main_~nondetString1~0.offset 2) (select |#length| main_~nondetString1~0.base))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1716#(<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))} is VALID [2020-07-29 00:51:54,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {1716#(<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1720#(<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:54,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1724#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:54,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {1724#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {1724#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:54,662 INFO L263 TraceCheckUtils]: 18: Hoare triple {1724#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1665#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:51:54,663 INFO L280 TraceCheckUtils]: 19: Hoare triple {1665#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1666#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:54,663 INFO L280 TraceCheckUtils]: 20: Hoare triple {1666#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1657#false} is VALID [2020-07-29 00:51:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:54,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:51:54,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-29 00:51:54,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193836859] [2020-07-29 00:51:54,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-07-29 00:51:54,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:54,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 00:51:54,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:54,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-29 00:51:54,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 00:51:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-07-29 00:51:54,712 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 15 states. [2020-07-29 00:51:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:55,420 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 00:51:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 00:51:55,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-07-29 00:51:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 00:51:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-29 00:51:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 00:51:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-29 00:51:55,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2020-07-29 00:51:55,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:55,479 INFO L225 Difference]: With dead ends: 31 [2020-07-29 00:51:55,479 INFO L226 Difference]: Without dead ends: 31 [2020-07-29 00:51:55,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-07-29 00:51:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-29 00:51:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-07-29 00:51:55,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:55,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2020-07-29 00:51:55,482 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2020-07-29 00:51:55,482 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2020-07-29 00:51:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:55,483 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 00:51:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 00:51:55,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:55,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:55,484 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2020-07-29 00:51:55,484 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2020-07-29 00:51:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:55,485 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 00:51:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 00:51:55,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:55,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:55,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:55,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 00:51:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-29 00:51:55,487 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2020-07-29 00:51:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:55,487 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-29 00:51:55,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-29 00:51:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 00:51:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 00:51:55,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:55,488 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:55,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:51:55,702 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1692198505, now seen corresponding path program 2 times [2020-07-29 00:51:55,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:55,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422880233] [2020-07-29 00:51:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:56,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:56,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1867#true} is VALID [2020-07-29 00:51:56,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {1867#true} assume true; {1867#true} is VALID [2020-07-29 00:51:56,100 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1867#true} {1867#true} #63#return; {1867#true} is VALID [2020-07-29 00:51:56,101 INFO L263 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1882#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:56,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1867#true} is VALID [2020-07-29 00:51:56,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2020-07-29 00:51:56,101 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #63#return; {1867#true} is VALID [2020-07-29 00:51:56,101 INFO L263 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret9 := main(); {1867#true} is VALID [2020-07-29 00:51:56,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {1867#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1867#true} is VALID [2020-07-29 00:51:56,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {1867#true} assume !(~length1~0 < 1); {1867#true} is VALID [2020-07-29 00:51:56,108 INFO L280 TraceCheckUtils]: 7: Hoare triple {1867#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1872#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:56,109 INFO L280 TraceCheckUtils]: 8: Hoare triple {1872#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} is VALID [2020-07-29 00:51:56,110 INFO L280 TraceCheckUtils]: 9: Hoare triple {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} is VALID [2020-07-29 00:51:56,110 INFO L280 TraceCheckUtils]: 10: Hoare triple {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} havoc #t~nondet7; {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} is VALID [2020-07-29 00:51:56,111 INFO L280 TraceCheckUtils]: 11: Hoare triple {1873#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset) (<= (+ main_~i~0 2) main_~length1~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1874#(and (< 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= 0 main_~nondetString1~0.offset) (or (<= (+ main_~nondetString1~0.offset main_~length1~0) 2) (<= main_~i~0 1)))} is VALID [2020-07-29 00:51:56,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {1874#(and (< 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= 0 main_~nondetString1~0.offset) (or (<= (+ main_~nondetString1~0.offset main_~length1~0) 2) (<= main_~i~0 1)))} assume !(~i~0 < ~length1~0 - 1); {1875#(and (= 0 main_~nondetString1~0.offset) (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))} is VALID [2020-07-29 00:51:56,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {1875#(and (= 0 main_~nondetString1~0.offset) (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1876#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:56,113 INFO L263 TraceCheckUtils]: 14: Hoare triple {1876#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1877#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:56,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {1877#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} is VALID [2020-07-29 00:51:56,115 INFO L280 TraceCheckUtils]: 16: Hoare triple {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} is VALID [2020-07-29 00:51:56,115 INFO L280 TraceCheckUtils]: 17: Hoare triple {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} assume !(0 == #t~mem2);havoc #t~mem2; {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} is VALID [2020-07-29 00:51:56,116 INFO L263 TraceCheckUtils]: 18: Hoare triple {1878#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1879#(and (<= 1 |strlen_rec_#in~p.offset|) (<= |strlen_rec_#in~p.offset| 1) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)))} is VALID [2020-07-29 00:51:56,118 INFO L280 TraceCheckUtils]: 19: Hoare triple {1879#(and (<= 1 |strlen_rec_#in~p.offset|) (<= |strlen_rec_#in~p.offset| 1) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1880#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset)) (= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:56,119 INFO L280 TraceCheckUtils]: 20: Hoare triple {1880#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset)) (= 1 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1881#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:51:56,120 INFO L280 TraceCheckUtils]: 21: Hoare triple {1881#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {1868#false} is VALID [2020-07-29 00:51:56,120 INFO L263 TraceCheckUtils]: 22: Hoare triple {1868#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1868#false} is VALID [2020-07-29 00:51:56,120 INFO L280 TraceCheckUtils]: 23: Hoare triple {1868#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1868#false} is VALID [2020-07-29 00:51:56,120 INFO L280 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1868#false} is VALID [2020-07-29 00:51:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:56,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422880233] [2020-07-29 00:51:56,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121606495] [2020-07-29 00:51:56,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-29 00:51:56,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 00:51:56,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:51:56,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 00:51:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:56,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:51:56,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2020-07-29 00:51:56,364 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:51:56,374 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:51:56,384 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 00:51:56,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2020-07-29 00:51:56,389 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:51:56,389 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, main_~length1~0]. (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (store |v_#memory_int_8| main_~nondetString1~0.base (store (select |v_#memory_int_8| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset main_~length1~0 (- 1)) 0)) |#memory_int|)) [2020-07-29 00:51:56,389 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~length1~0]. (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset main_~length1~0 (- 1))))) [2020-07-29 00:51:56,953 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:51:56,954 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 18 [2020-07-29 00:51:56,955 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 00:51:56,969 INFO L624 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2020-07-29 00:51:56,981 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:51:56,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2020-07-29 00:51:56,984 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:51:56,985 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, strlen_rec_~p.base, strlen_rec_~p.offset, main_~length1~0]. (let ((.cse0 (select |#memory_int| strlen_rec_~p.base))) (and (= 0 (select .cse0 (+ strlen_rec_~p.offset main_~length1~0 (- 2)))) (= (select .cse0 strlen_rec_~p.offset) |strlen_rec_#t~mem2|) (< 1 main_~length1~0) (<= main_~length1~0 2))) [2020-07-29 00:51:56,985 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |strlen_rec_#t~mem2|) [2020-07-29 00:51:56,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1867#true} is VALID [2020-07-29 00:51:56,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {1867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1867#true} is VALID [2020-07-29 00:51:56,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2020-07-29 00:51:56,993 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #63#return; {1867#true} is VALID [2020-07-29 00:51:56,994 INFO L263 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret9 := main(); {1867#true} is VALID [2020-07-29 00:51:56,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {1867#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {1867#true} is VALID [2020-07-29 00:51:56,995 INFO L280 TraceCheckUtils]: 6: Hoare triple {1867#true} assume !(~length1~0 < 1); {1867#true} is VALID [2020-07-29 00:51:56,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {1867#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {1907#(= 0 main_~i~0)} is VALID [2020-07-29 00:51:56,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#(= 0 main_~i~0)} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} is VALID [2020-07-29 00:51:56,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} is VALID [2020-07-29 00:51:56,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} havoc #t~nondet7; {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} is VALID [2020-07-29 00:51:57,000 INFO L280 TraceCheckUtils]: 11: Hoare triple {1911#(and (= 0 main_~i~0) (< (+ main_~i~0 1) main_~length1~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1921#(and (< 1 main_~length1~0) (<= main_~i~0 1))} is VALID [2020-07-29 00:51:57,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {1921#(and (< 1 main_~length1~0) (<= main_~i~0 1))} assume !(~i~0 < ~length1~0 - 1); {1925#(and (< 1 main_~length1~0) (<= main_~length1~0 2))} is VALID [2020-07-29 00:51:57,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {1925#(and (< 1 main_~length1~0) (<= main_~length1~0 2))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {1929#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset main_~length1~0 (- 1))))))} is VALID [2020-07-29 00:51:57,002 INFO L263 TraceCheckUtils]: 14: Hoare triple {1929#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset main_~length1~0 (- 1))))))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {1933#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| main_~length1~0 (- 1))))))} is VALID [2020-07-29 00:51:57,003 INFO L280 TraceCheckUtils]: 15: Hoare triple {1933#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| main_~length1~0 (- 1))))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} is VALID [2020-07-29 00:51:57,004 INFO L280 TraceCheckUtils]: 16: Hoare triple {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} is VALID [2020-07-29 00:51:57,004 INFO L280 TraceCheckUtils]: 17: Hoare triple {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} assume !(0 == #t~mem2);havoc #t~mem2; {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} is VALID [2020-07-29 00:51:57,007 INFO L263 TraceCheckUtils]: 18: Hoare triple {1937#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 1))) 0)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1947#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| main_~length1~0 (- 2))))))} is VALID [2020-07-29 00:51:57,008 INFO L280 TraceCheckUtils]: 19: Hoare triple {1947#(exists ((main_~length1~0 Int)) (and (< 1 main_~length1~0) (<= main_~length1~0 2) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| main_~length1~0 (- 2))))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1951#(exists ((main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 2)))) (< 1 main_~length1~0) (<= main_~length1~0 2)))} is VALID [2020-07-29 00:51:57,009 INFO L280 TraceCheckUtils]: 20: Hoare triple {1951#(exists ((main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset main_~length1~0 (- 2)))) (< 1 main_~length1~0) (<= main_~length1~0 2)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {1881#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:51:57,010 INFO L280 TraceCheckUtils]: 21: Hoare triple {1881#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {1868#false} is VALID [2020-07-29 00:51:57,010 INFO L263 TraceCheckUtils]: 22: Hoare triple {1868#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {1868#false} is VALID [2020-07-29 00:51:57,010 INFO L280 TraceCheckUtils]: 23: Hoare triple {1868#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1868#false} is VALID [2020-07-29 00:51:57,010 INFO L280 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {1868#false} is VALID [2020-07-29 00:51:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:57,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:51:57,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2020-07-29 00:51:57,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874717323] [2020-07-29 00:51:57,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2020-07-29 00:51:57,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:57,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-29 00:51:57,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:57,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-29 00:51:57,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-29 00:51:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-07-29 00:51:57,076 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 22 states. [2020-07-29 00:51:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:58,156 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-29 00:51:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 00:51:58,156 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2020-07-29 00:51:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:51:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:51:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-29 00:51:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:51:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-29 00:51:58,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2020-07-29 00:51:58,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:58,211 INFO L225 Difference]: With dead ends: 42 [2020-07-29 00:51:58,211 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 00:51:58,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2020-07-29 00:51:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 00:51:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-29 00:51:58,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:51:58,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2020-07-29 00:51:58,215 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2020-07-29 00:51:58,215 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2020-07-29 00:51:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:58,216 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-29 00:51:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-29 00:51:58,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:58,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:58,217 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2020-07-29 00:51:58,217 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2020-07-29 00:51:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:51:58,218 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-29 00:51:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-29 00:51:58,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:51:58,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:51:58,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:51:58,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:51:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 00:51:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-29 00:51:58,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2020-07-29 00:51:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:51:58,220 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-29 00:51:58,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-29 00:51:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 00:51:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-29 00:51:58,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:51:58,221 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:51:58,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-29 00:51:58,427 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:51:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:51:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1062009716, now seen corresponding path program 3 times [2020-07-29 00:51:58,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:51:58,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448367770] [2020-07-29 00:51:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:51:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:58,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:51:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:58,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {2134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2120#true} is VALID [2020-07-29 00:51:58,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-29 00:51:58,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2120#true} {2120#true} #63#return; {2120#true} is VALID [2020-07-29 00:51:58,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {2120#true} call ULTIMATE.init(); {2134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:51:58,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {2134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2120#true} is VALID [2020-07-29 00:51:58,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-29 00:51:58,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2120#true} {2120#true} #63#return; {2120#true} is VALID [2020-07-29 00:51:58,718 INFO L263 TraceCheckUtils]: 4: Hoare triple {2120#true} call #t~ret9 := main(); {2120#true} is VALID [2020-07-29 00:51:58,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {2120#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2120#true} is VALID [2020-07-29 00:51:58,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {2120#true} assume !(~length1~0 < 1); {2120#true} is VALID [2020-07-29 00:51:58,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {2120#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {2125#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2126#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:51:58,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {2126#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:51:58,732 INFO L263 TraceCheckUtils]: 18: Hoare triple {2127#(and (<= 3 (select |#length| main_~nondetString1~0.base)) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2128#(and (<= 3 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:51:58,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {2128#(and (<= 3 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:58,734 INFO L280 TraceCheckUtils]: 20: Hoare triple {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:58,735 INFO L280 TraceCheckUtils]: 21: Hoare triple {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:58,736 INFO L263 TraceCheckUtils]: 22: Hoare triple {2129#(and (= 0 strlen_rec_~p.offset) (<= 3 (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2130#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:51:58,737 INFO L280 TraceCheckUtils]: 23: Hoare triple {2130#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:58,740 INFO L280 TraceCheckUtils]: 24: Hoare triple {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:58,743 INFO L280 TraceCheckUtils]: 25: Hoare triple {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:58,745 INFO L263 TraceCheckUtils]: 26: Hoare triple {2131#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2132#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:51:58,746 INFO L280 TraceCheckUtils]: 27: Hoare triple {2132#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2133#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:58,747 INFO L280 TraceCheckUtils]: 28: Hoare triple {2133#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2121#false} is VALID [2020-07-29 00:51:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:58,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448367770] [2020-07-29 00:51:58,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130878242] [2020-07-29 00:51:58,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:51:58,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 00:51:58,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:51:58,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 00:51:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:51:58,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:51:59,481 INFO L263 TraceCheckUtils]: 0: Hoare triple {2120#true} call ULTIMATE.init(); {2120#true} is VALID [2020-07-29 00:51:59,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2120#true} is VALID [2020-07-29 00:51:59,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-29 00:51:59,482 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2120#true} {2120#true} #63#return; {2120#true} is VALID [2020-07-29 00:51:59,482 INFO L263 TraceCheckUtils]: 4: Hoare triple {2120#true} call #t~ret9 := main(); {2120#true} is VALID [2020-07-29 00:51:59,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {2120#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2120#true} is VALID [2020-07-29 00:51:59,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {2120#true} assume !(~length1~0 < 1); {2120#true} is VALID [2020-07-29 00:51:59,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {2120#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2159#(<= 0 main_~i~0)} is VALID [2020-07-29 00:51:59,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {2159#(<= 0 main_~i~0)} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2159#(<= 0 main_~i~0)} is VALID [2020-07-29 00:51:59,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {2159#(<= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2159#(<= 0 main_~i~0)} is VALID [2020-07-29 00:51:59,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {2159#(<= 0 main_~i~0)} havoc #t~nondet7; {2159#(<= 0 main_~i~0)} is VALID [2020-07-29 00:51:59,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {2159#(<= 0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2172#(<= 1 main_~i~0)} is VALID [2020-07-29 00:51:59,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {2172#(<= 1 main_~i~0)} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2176#(<= 3 main_~length1~0)} is VALID [2020-07-29 00:51:59,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {2176#(<= 3 main_~length1~0)} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2176#(<= 3 main_~length1~0)} is VALID [2020-07-29 00:51:59,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {2176#(<= 3 main_~length1~0)} havoc #t~nondet7; {2176#(<= 3 main_~length1~0)} is VALID [2020-07-29 00:51:59,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {2176#(<= 3 main_~length1~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2176#(<= 3 main_~length1~0)} is VALID [2020-07-29 00:51:59,488 INFO L280 TraceCheckUtils]: 16: Hoare triple {2176#(<= 3 main_~length1~0)} assume !(~i~0 < ~length1~0 - 1); {2176#(<= 3 main_~length1~0)} is VALID [2020-07-29 00:51:59,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {2176#(<= 3 main_~length1~0)} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2192#(<= (+ main_~nondetString1~0.offset 3) (select |#length| main_~nondetString1~0.base))} is VALID [2020-07-29 00:51:59,489 INFO L263 TraceCheckUtils]: 18: Hoare triple {2192#(<= (+ main_~nondetString1~0.offset 3) (select |#length| main_~nondetString1~0.base))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2196#(<= (+ |strlen_rec_#in~p.offset| 3) (select |#length| |strlen_rec_#in~p.base|))} is VALID [2020-07-29 00:51:59,490 INFO L280 TraceCheckUtils]: 19: Hoare triple {2196#(<= (+ |strlen_rec_#in~p.offset| 3) (select |#length| |strlen_rec_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:59,490 INFO L280 TraceCheckUtils]: 20: Hoare triple {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:59,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} assume !(0 == #t~mem2);havoc #t~mem2; {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:59,496 INFO L263 TraceCheckUtils]: 22: Hoare triple {2200#(<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2210#(<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))} is VALID [2020-07-29 00:51:59,496 INFO L280 TraceCheckUtils]: 23: Hoare triple {2210#(<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2214#(<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base))} is VALID [2020-07-29 00:51:59,497 INFO L280 TraceCheckUtils]: 24: Hoare triple {2214#(<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2218#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:59,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {2218#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {2218#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:51:59,499 INFO L263 TraceCheckUtils]: 26: Hoare triple {2218#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2225#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:51:59,499 INFO L280 TraceCheckUtils]: 27: Hoare triple {2225#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2229#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:51:59,503 INFO L280 TraceCheckUtils]: 28: Hoare triple {2229#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2121#false} is VALID [2020-07-29 00:51:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:51:59,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:51:59,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2020-07-29 00:51:59,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94154064] [2020-07-29 00:51:59,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-07-29 00:51:59,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:51:59,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-29 00:51:59,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:51:59,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-29 00:51:59,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:51:59,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-29 00:51:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2020-07-29 00:51:59,586 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 23 states. [2020-07-29 00:52:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:00,746 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 00:52:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 00:52:00,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-07-29 00:52:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:52:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 00:52:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2020-07-29 00:52:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 00:52:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2020-07-29 00:52:00,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2020-07-29 00:52:00,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:00,810 INFO L225 Difference]: With dead ends: 36 [2020-07-29 00:52:00,810 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 00:52:00,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2020-07-29 00:52:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 00:52:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-07-29 00:52:00,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:52:00,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2020-07-29 00:52:00,815 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2020-07-29 00:52:00,815 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2020-07-29 00:52:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:00,816 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 00:52:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 00:52:00,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:00,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:00,817 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2020-07-29 00:52:00,817 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2020-07-29 00:52:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:00,818 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 00:52:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 00:52:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:00,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:00,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:52:00,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:52:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 00:52:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-07-29 00:52:00,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2020-07-29 00:52:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:52:00,820 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-07-29 00:52:00,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-29 00:52:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-29 00:52:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-29 00:52:00,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:52:00,821 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:52:01,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:52:01,030 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:52:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:52:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1867118562, now seen corresponding path program 4 times [2020-07-29 00:52:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:52:01,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761100141] [2020-07-29 00:52:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:52:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:01,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:52:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:01,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {2406#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2388#true} is VALID [2020-07-29 00:52:01,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {2388#true} assume true; {2388#true} is VALID [2020-07-29 00:52:01,405 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2020-07-29 00:52:01,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2406#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:52:01,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2388#true} is VALID [2020-07-29 00:52:01,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2020-07-29 00:52:01,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2020-07-29 00:52:01,408 INFO L263 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret9 := main(); {2388#true} is VALID [2020-07-29 00:52:01,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {2388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2388#true} is VALID [2020-07-29 00:52:01,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {2388#true} assume !(~length1~0 < 1); {2388#true} is VALID [2020-07-29 00:52:01,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {2388#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {2393#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2394#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:01,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {2394#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:01,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:01,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} havoc #t~nondet7; {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:01,421 INFO L280 TraceCheckUtils]: 15: Hoare triple {2395#(and (<= 3 main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2396#(and (<= 3 main_~length1~0) (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {2396#(and (<= 3 main_~length1~0) (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {2397#(and (<= 3 main_~length1~0) (<= main_~length1~0 3) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,424 INFO L280 TraceCheckUtils]: 17: Hoare triple {2397#(and (<= 3 main_~length1~0) (<= main_~length1~0 3) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2398#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset 2))) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:01,426 INFO L263 TraceCheckUtils]: 18: Hoare triple {2398#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset 2))) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2399#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 2)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:01,427 INFO L280 TraceCheckUtils]: 19: Hoare triple {2399#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 2)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} is VALID [2020-07-29 00:52:01,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} is VALID [2020-07-29 00:52:01,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} assume !(0 == #t~mem2);havoc #t~mem2; {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} is VALID [2020-07-29 00:52:01,431 INFO L263 TraceCheckUtils]: 22: Hoare triple {2400#(and (= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) 2)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2401#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 1)))} is VALID [2020-07-29 00:52:01,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {2401#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 1)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:01,433 INFO L280 TraceCheckUtils]: 24: Hoare triple {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:01,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} assume !(0 == #t~mem2);havoc #t~mem2; {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:01,436 INFO L263 TraceCheckUtils]: 26: Hoare triple {2402#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2403#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:01,437 INFO L280 TraceCheckUtils]: 27: Hoare triple {2403#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2404#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:01,439 INFO L280 TraceCheckUtils]: 28: Hoare triple {2404#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2405#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:52:01,439 INFO L280 TraceCheckUtils]: 29: Hoare triple {2405#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {2389#false} is VALID [2020-07-29 00:52:01,440 INFO L263 TraceCheckUtils]: 30: Hoare triple {2389#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2389#false} is VALID [2020-07-29 00:52:01,440 INFO L280 TraceCheckUtils]: 31: Hoare triple {2389#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2389#false} is VALID [2020-07-29 00:52:01,440 INFO L280 TraceCheckUtils]: 32: Hoare triple {2389#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2389#false} is VALID [2020-07-29 00:52:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:52:01,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761100141] [2020-07-29 00:52:01,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437304981] [2020-07-29 00:52:01,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:52:01,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 00:52:01,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:52:01,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-29 00:52:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:01,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:52:01,630 INFO L384 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 [2020-07-29 00:52:01,630 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:01,637 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:01,638 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:01,638 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 00:52:01,642 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:01,643 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_12|]. (and (<= main_~i~0 0) (= |#length| (store |v_#length_12| main_~nondetString1~0.base main_~length1~0)) (= 0 main_~nondetString1~0.offset)) [2020-07-29 00:52:01,643 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset)) [2020-07-29 00:52:01,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2020-07-29 00:52:01,860 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:01,866 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:01,867 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:01,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-29 00:52:02,415 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2020-07-29 00:52:02,434 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 00:52:02,445 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:02,459 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 00:52:02,462 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:02,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 10 [2020-07-29 00:52:02,463 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:02,471 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:02,499 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:02,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2020-07-29 00:52:02,502 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:02,503 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, strlen_rec_~p.base, strlen_rec_~p.offset, |#length|]. (let ((.cse1 (select |#memory_int| strlen_rec_~p.base)) (.cse0 (select |#length| strlen_rec_~p.base))) (and (<= .cse0 3) (= (select .cse1 strlen_rec_~p.offset) |strlen_rec_#t~mem2|) (<= (+ strlen_rec_~p.offset 1) .cse0) (<= 2 strlen_rec_~p.offset) (= 0 (select .cse1 (+ .cse0 (- 1)))))) [2020-07-29 00:52:02,503 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |strlen_rec_#t~mem2|) [2020-07-29 00:52:02,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2020-07-29 00:52:02,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2388#true} is VALID [2020-07-29 00:52:02,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2020-07-29 00:52:02,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2020-07-29 00:52:02,507 INFO L263 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret9 := main(); {2388#true} is VALID [2020-07-29 00:52:02,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {2388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2388#true} is VALID [2020-07-29 00:52:02,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {2388#true} assume !(~length1~0 < 1); {2388#true} is VALID [2020-07-29 00:52:02,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {2388#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {2431#(and (<= main_~i~0 0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:02,521 INFO L280 TraceCheckUtils]: 12: Hoare triple {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:02,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:02,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} havoc #t~nondet7; {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} is VALID [2020-07-29 00:52:02,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {2444#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2457#(and (<= main_~i~0 2) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {2457#(and (<= main_~i~0 2) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {2461#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= main_~length1~0 3) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:02,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {2461#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= main_~length1~0 3) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2465#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (- 1)))) (<= (select |#length| main_~nondetString1~0.base) 3))} is VALID [2020-07-29 00:52:02,527 INFO L263 TraceCheckUtils]: 18: Hoare triple {2465#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (- 1)))) (<= (select |#length| main_~nondetString1~0.base) 3))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2469#(and (<= (select |#length| |strlen_rec_#in~p.base|) 3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} is VALID [2020-07-29 00:52:02,528 INFO L280 TraceCheckUtils]: 19: Hoare triple {2469#(and (<= (select |#length| |strlen_rec_#in~p.base|) 3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2473#(and (<= (select |#length| strlen_rec_~p.base) 3) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {2473#(and (<= (select |#length| strlen_rec_~p.base) 3) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2477#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {2477#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} assume !(0 == #t~mem2);havoc #t~mem2; {2477#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,532 INFO L263 TraceCheckUtils]: 22: Hoare triple {2477#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 0 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2484#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (select |#length| |strlen_rec_#in~p.base|) 3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} is VALID [2020-07-29 00:52:02,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {2484#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (select |#length| |strlen_rec_#in~p.base|) 3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,534 INFO L280 TraceCheckUtils]: 24: Hoare triple {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,535 INFO L280 TraceCheckUtils]: 25: Hoare triple {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} assume !(0 == #t~mem2);havoc #t~mem2; {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,536 INFO L263 TraceCheckUtils]: 26: Hoare triple {2488#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2498#(and (<= (select |#length| |strlen_rec_#in~p.base|) 3) (<= 2 |strlen_rec_#in~p.offset|) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} is VALID [2020-07-29 00:52:02,537 INFO L280 TraceCheckUtils]: 27: Hoare triple {2498#(and (<= (select |#length| |strlen_rec_#in~p.base|) 3) (<= 2 |strlen_rec_#in~p.offset|) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1)))))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2502#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 2 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} is VALID [2020-07-29 00:52:02,538 INFO L280 TraceCheckUtils]: 28: Hoare triple {2502#(and (<= (select |#length| strlen_rec_~p.base) 3) (<= 2 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2405#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:52:02,543 INFO L280 TraceCheckUtils]: 29: Hoare triple {2405#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {2389#false} is VALID [2020-07-29 00:52:02,543 INFO L263 TraceCheckUtils]: 30: Hoare triple {2389#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2389#false} is VALID [2020-07-29 00:52:02,544 INFO L280 TraceCheckUtils]: 31: Hoare triple {2389#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2389#false} is VALID [2020-07-29 00:52:02,544 INFO L280 TraceCheckUtils]: 32: Hoare triple {2389#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2389#false} is VALID [2020-07-29 00:52:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:52:02,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:52:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2020-07-29 00:52:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47420536] [2020-07-29 00:52:02,552 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2020-07-29 00:52:02,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:52:02,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2020-07-29 00:52:02,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:02,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-29 00:52:02,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:52:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-29 00:52:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2020-07-29 00:52:02,625 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 28 states. [2020-07-29 00:52:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:04,851 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 00:52:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 00:52:04,851 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2020-07-29 00:52:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:52:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 00:52:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2020-07-29 00:52:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 00:52:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2020-07-29 00:52:04,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2020-07-29 00:52:04,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:04,925 INFO L225 Difference]: With dead ends: 54 [2020-07-29 00:52:04,925 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 00:52:04,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2020-07-29 00:52:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 00:52:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-29 00:52:04,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:52:04,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2020-07-29 00:52:04,929 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2020-07-29 00:52:04,929 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2020-07-29 00:52:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:04,930 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 00:52:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 00:52:04,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:04,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:04,931 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2020-07-29 00:52:04,931 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2020-07-29 00:52:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:04,932 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 00:52:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 00:52:04,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:04,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:04,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:52:04,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:52:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 00:52:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-29 00:52:04,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2020-07-29 00:52:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:52:04,934 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-29 00:52:04,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-29 00:52:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 00:52:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-29 00:52:04,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:52:04,935 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:52:05,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-29 00:52:05,138 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:52:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:52:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash 545438971, now seen corresponding path program 5 times [2020-07-29 00:52:05,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:52:05,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872573527] [2020-07-29 00:52:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:52:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:05,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:52:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:05,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2717#true} is VALID [2020-07-29 00:52:05,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {2717#true} assume true; {2717#true} is VALID [2020-07-29 00:52:05,463 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2717#true} {2717#true} #63#return; {2717#true} is VALID [2020-07-29 00:52:05,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {2717#true} call ULTIMATE.init(); {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:52:05,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2717#true} is VALID [2020-07-29 00:52:05,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {2717#true} assume true; {2717#true} is VALID [2020-07-29 00:52:05,464 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2717#true} {2717#true} #63#return; {2717#true} is VALID [2020-07-29 00:52:05,464 INFO L263 TraceCheckUtils]: 4: Hoare triple {2717#true} call #t~ret9 := main(); {2717#true} is VALID [2020-07-29 00:52:05,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {2717#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2717#true} is VALID [2020-07-29 00:52:05,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {2717#true} assume !(~length1~0 < 1); {2717#true} is VALID [2020-07-29 00:52:05,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {2717#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:05,466 INFO L280 TraceCheckUtils]: 8: Hoare triple {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:05,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:05,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:05,474 INFO L280 TraceCheckUtils]: 11: Hoare triple {2722#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:05,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:05,475 INFO L280 TraceCheckUtils]: 13: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:05,476 INFO L280 TraceCheckUtils]: 14: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} havoc #t~nondet7; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:05,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2724#(and (<= 2 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:05,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {2724#(and (<= 2 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,479 INFO L280 TraceCheckUtils]: 17: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,479 INFO L280 TraceCheckUtils]: 18: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} havoc #t~nondet7; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,480 INFO L280 TraceCheckUtils]: 19: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} assume !(~i~0 < ~length1~0 - 1); {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:05,483 INFO L263 TraceCheckUtils]: 22: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2726#(and (<= 4 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:05,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {2726#(and (<= 4 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,485 INFO L280 TraceCheckUtils]: 24: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,486 INFO L280 TraceCheckUtils]: 25: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,488 INFO L263 TraceCheckUtils]: 26: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2728#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 3) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:05,489 INFO L280 TraceCheckUtils]: 27: Hoare triple {2728#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 3) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,490 INFO L280 TraceCheckUtils]: 28: Hoare triple {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,491 INFO L280 TraceCheckUtils]: 29: Hoare triple {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:05,493 INFO L263 TraceCheckUtils]: 30: Hoare triple {2729#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 3) (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2730#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:05,493 INFO L280 TraceCheckUtils]: 31: Hoare triple {2730#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:05,494 INFO L280 TraceCheckUtils]: 32: Hoare triple {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:05,495 INFO L280 TraceCheckUtils]: 33: Hoare triple {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:05,496 INFO L263 TraceCheckUtils]: 34: Hoare triple {2731#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2732#(and (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)) (<= 3 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:05,497 INFO L280 TraceCheckUtils]: 35: Hoare triple {2732#(and (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)) (<= 3 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2733#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 3 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:05,498 INFO L280 TraceCheckUtils]: 36: Hoare triple {2733#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 3 strlen_rec_~p.offset))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2718#false} is VALID [2020-07-29 00:52:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:52:05,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872573527] [2020-07-29 00:52:05,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693080729] [2020-07-29 00:52:05,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:52:05,591 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-29 00:52:05,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:52:05,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2020-07-29 00:52:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:05,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:52:05,620 INFO L384 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 [2020-07-29 00:52:05,621 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:05,626 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:05,627 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:05,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 00:52:05,629 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:05,629 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_13|]. (and (<= 0 main_~i~0) (= |#length| (store |v_#length_13| main_~nondetString1~0.base main_~length1~0)) (= 0 main_~nondetString1~0.offset)) [2020-07-29 00:52:05,630 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset)) [2020-07-29 00:52:06,014 INFO L263 TraceCheckUtils]: 0: Hoare triple {2717#true} call ULTIMATE.init(); {2717#true} is VALID [2020-07-29 00:52:06,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {2717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2717#true} is VALID [2020-07-29 00:52:06,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {2717#true} assume true; {2717#true} is VALID [2020-07-29 00:52:06,015 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2717#true} {2717#true} #63#return; {2717#true} is VALID [2020-07-29 00:52:06,015 INFO L263 TraceCheckUtils]: 4: Hoare triple {2717#true} call #t~ret9 := main(); {2717#true} is VALID [2020-07-29 00:52:06,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {2717#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {2717#true} is VALID [2020-07-29 00:52:06,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {2717#true} assume !(~length1~0 < 1); {2717#true} is VALID [2020-07-29 00:52:06,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {2717#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:06,023 INFO L280 TraceCheckUtils]: 8: Hoare triple {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:06,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:06,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:06,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {2759#(and (<= 0 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:06,027 INFO L280 TraceCheckUtils]: 12: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:06,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:06,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} havoc #t~nondet7; {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:06,028 INFO L280 TraceCheckUtils]: 15: Hoare triple {2723#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2724#(and (<= 2 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:06,029 INFO L280 TraceCheckUtils]: 16: Hoare triple {2724#(and (<= 2 main_~i~0) (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,030 INFO L280 TraceCheckUtils]: 17: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,030 INFO L280 TraceCheckUtils]: 18: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} havoc #t~nondet7; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,031 INFO L280 TraceCheckUtils]: 19: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} assume !(~i~0 < ~length1~0 - 1); {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,033 INFO L280 TraceCheckUtils]: 21: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} is VALID [2020-07-29 00:52:06,033 INFO L263 TraceCheckUtils]: 22: Hoare triple {2725#(and (= 0 main_~nondetString1~0.offset) (<= 4 (select |#length| main_~nondetString1~0.base)))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {2726#(and (<= 4 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:06,034 INFO L280 TraceCheckUtils]: 23: Hoare triple {2726#(and (<= 4 (select |#length| |strlen_rec_#in~p.base|)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,034 INFO L280 TraceCheckUtils]: 24: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,035 INFO L280 TraceCheckUtils]: 25: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,036 INFO L263 TraceCheckUtils]: 26: Hoare triple {2727#(and (= 0 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2817#(and (= 1 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:06,036 INFO L280 TraceCheckUtils]: 27: Hoare triple {2817#(and (= 1 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:06,037 INFO L280 TraceCheckUtils]: 28: Hoare triple {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:06,039 INFO L280 TraceCheckUtils]: 29: Hoare triple {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:06,040 INFO L263 TraceCheckUtils]: 30: Hoare triple {2821#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 1 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2831#(and (= 2 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:06,041 INFO L280 TraceCheckUtils]: 31: Hoare triple {2831#(and (= 2 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,041 INFO L280 TraceCheckUtils]: 32: Hoare triple {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,042 INFO L280 TraceCheckUtils]: 33: Hoare triple {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:06,043 INFO L263 TraceCheckUtils]: 34: Hoare triple {2835#(and (= 2 strlen_rec_~p.offset) (<= 4 (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {2845#(and (= 3 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:06,044 INFO L280 TraceCheckUtils]: 35: Hoare triple {2845#(and (= 3 |strlen_rec_#in~p.offset|) (<= 4 (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {2849#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 3 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:06,045 INFO L280 TraceCheckUtils]: 36: Hoare triple {2849#(and (<= 4 (select |#length| strlen_rec_~p.base)) (= 3 strlen_rec_~p.offset))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {2718#false} is VALID [2020-07-29 00:52:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:52:06,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:52:06,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2020-07-29 00:52:06,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331172394] [2020-07-29 00:52:06,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2020-07-29 00:52:06,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:52:06,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-29 00:52:06,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:06,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-29 00:52:06,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:52:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-29 00:52:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2020-07-29 00:52:06,124 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 22 states. [2020-07-29 00:52:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:07,824 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 00:52:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 00:52:07,824 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2020-07-29 00:52:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:52:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:52:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-29 00:52:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:52:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-29 00:52:07,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2020-07-29 00:52:07,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:07,889 INFO L225 Difference]: With dead ends: 44 [2020-07-29 00:52:07,889 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 00:52:07,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2020-07-29 00:52:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 00:52:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-29 00:52:07,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:52:07,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-29 00:52:07,896 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-29 00:52:07,897 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-29 00:52:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:07,898 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 00:52:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 00:52:07,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:07,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:07,899 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-29 00:52:07,899 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-29 00:52:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:07,900 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 00:52:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 00:52:07,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:07,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:07,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:52:07,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:52:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 00:52:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-29 00:52:07,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2020-07-29 00:52:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:52:07,904 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-29 00:52:07,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-29 00:52:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 00:52:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-29 00:52:07,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:52:07,907 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:52:08,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:52:08,120 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-29 00:52:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:52:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1989258789, now seen corresponding path program 6 times [2020-07-29 00:52:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:52:08,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919493427] [2020-07-29 00:52:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:52:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:08,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:52:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:08,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {3065#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3044#true} is VALID [2020-07-29 00:52:08,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {3044#true} assume true; {3044#true} is VALID [2020-07-29 00:52:08,575 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2020-07-29 00:52:08,576 INFO L263 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3065#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:52:08,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {3065#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3044#true} is VALID [2020-07-29 00:52:08,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2020-07-29 00:52:08,577 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2020-07-29 00:52:08,577 INFO L263 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret9 := main(); {3044#true} is VALID [2020-07-29 00:52:08,577 INFO L280 TraceCheckUtils]: 5: Hoare triple {3044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {3044#true} is VALID [2020-07-29 00:52:08,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {3044#true} assume !(~length1~0 < 1); {3044#true} is VALID [2020-07-29 00:52:08,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {3044#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {3049#(and (= 0 main_~i~0) (= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:08,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:08,582 INFO L280 TraceCheckUtils]: 13: Hoare triple {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:08,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} havoc #t~nondet7; {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:52:08,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {3050#(and (= 0 main_~nondetString1~0.offset) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3051#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {3051#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} is VALID [2020-07-29 00:52:08,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} is VALID [2020-07-29 00:52:08,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} havoc #t~nondet7; {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} is VALID [2020-07-29 00:52:08,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {3052#(and (<= main_~i~0 2) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3053#(and (<= main_~i~0 3) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} is VALID [2020-07-29 00:52:08,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {3053#(and (<= main_~i~0 3) (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0))} assume !(~i~0 < ~length1~0 - 1); {3054#(and (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0) (<= main_~length1~0 4))} is VALID [2020-07-29 00:52:08,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {3054#(and (= 0 main_~nondetString1~0.offset) (<= 4 main_~length1~0) (<= main_~length1~0 4))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {3055#(and (= (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset 3)) 0) (= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:08,592 INFO L263 TraceCheckUtils]: 22: Hoare triple {3055#(and (= (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset 3)) 0) (= 0 main_~nondetString1~0.offset))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {3056#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 3)) (= 0 |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:08,599 INFO L280 TraceCheckUtils]: 23: Hoare triple {3056#(and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 3)) (= 0 |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:08,602 INFO L280 TraceCheckUtils]: 24: Hoare triple {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:08,606 INFO L280 TraceCheckUtils]: 25: Hoare triple {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} assume !(0 == #t~mem2);havoc #t~mem2; {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:08,607 INFO L263 TraceCheckUtils]: 26: Hoare triple {3057#(and (= 0 (select (select |#memory_int| strlen_rec_~p.base) 3)) (= 0 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3058#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 2)))} is VALID [2020-07-29 00:52:08,607 INFO L280 TraceCheckUtils]: 27: Hoare triple {3058#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 2)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} is VALID [2020-07-29 00:52:08,608 INFO L280 TraceCheckUtils]: 28: Hoare triple {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} is VALID [2020-07-29 00:52:08,609 INFO L280 TraceCheckUtils]: 29: Hoare triple {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} assume !(0 == #t~mem2);havoc #t~mem2; {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} is VALID [2020-07-29 00:52:08,610 INFO L263 TraceCheckUtils]: 30: Hoare triple {3059#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 2)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3060#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 1)))} is VALID [2020-07-29 00:52:08,611 INFO L280 TraceCheckUtils]: 31: Hoare triple {3060#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ |strlen_rec_#in~p.offset| 1)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:08,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:08,612 INFO L280 TraceCheckUtils]: 33: Hoare triple {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} assume !(0 == #t~mem2);havoc #t~mem2; {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} is VALID [2020-07-29 00:52:08,613 INFO L263 TraceCheckUtils]: 34: Hoare triple {3061#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ strlen_rec_~p.offset 1)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3062#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} is VALID [2020-07-29 00:52:08,614 INFO L280 TraceCheckUtils]: 35: Hoare triple {3062#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3063#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:08,615 INFO L280 TraceCheckUtils]: 36: Hoare triple {3063#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3064#(= 0 |strlen_rec_#t~mem2|)} is VALID [2020-07-29 00:52:08,615 INFO L280 TraceCheckUtils]: 37: Hoare triple {3064#(= 0 |strlen_rec_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {3045#false} is VALID [2020-07-29 00:52:08,615 INFO L263 TraceCheckUtils]: 38: Hoare triple {3045#false} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3045#false} is VALID [2020-07-29 00:52:08,616 INFO L280 TraceCheckUtils]: 39: Hoare triple {3045#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3045#false} is VALID [2020-07-29 00:52:08,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {3045#false} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {3045#false} is VALID [2020-07-29 00:52:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:52:08,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919493427] [2020-07-29 00:52:08,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201833585] [2020-07-29 00:52:08,620 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:52:08,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-07-29 00:52:08,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:52:08,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-29 00:52:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:52:08,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:52:08,771 INFO L384 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 [2020-07-29 00:52:08,771 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:08,777 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:08,777 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:08,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 00:52:08,780 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:08,780 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_14|]. (and (<= 0 main_~nondetString1~0.offset) (= |#length| (store |v_#length_14| main_~nondetString1~0.base main_~length1~0))) [2020-07-29 00:52:08,780 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset)) [2020-07-29 00:52:08,882 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2020-07-29 00:52:08,883 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:52:08,890 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:08,898 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 00:52:08,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-29 00:52:08,902 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:08,902 WARN L407 uantifierElimination]: Input elimination task: ∃ [main_~nondetString1~0.offset, |v_#memory_int_10|]. (and (<= main_~nondetString1~0.offset 0) (<= 0 main_~nondetString1~0.offset) (= |#memory_int| (store |v_#memory_int_10| main_~nondetString1~0.base (store (select |v_#memory_int_10| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base) (- 1)) 0)))) [2020-07-29 00:52:08,903 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~nondetString1~0.offset]. (and (<= main_~nondetString1~0.offset 0) (<= 0 main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base) (- 1))))) [2020-07-29 00:52:09,721 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:09,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 20 [2020-07-29 00:52:09,723 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 00:52:09,739 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:52:09,750 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 00:52:09,788 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:52:09,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:27 [2020-07-29 00:52:09,798 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:52:09,798 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~nondetString1~0.offset]. (let ((.cse0 (select |#memory_int| strlen_rec_~p.base)) (.cse1 (select |#length| strlen_rec_~p.base))) (and (= (select .cse0 strlen_rec_~p.offset) |strlen_rec_#t~mem2|) (<= main_~nondetString1~0.offset 0) (= 0 (select .cse0 (+ .cse1 main_~nondetString1~0.offset (- 1)))) (<= (+ strlen_rec_~p.offset 1) .cse1) (<= 0 strlen_rec_~p.offset) (<= 0 main_~nondetString1~0.offset))) [2020-07-29 00:52:09,799 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#length| strlen_rec_~p.base))) (and (<= (+ strlen_rec_~p.offset 1) .cse0) (<= 0 strlen_rec_~p.offset) (or (<= (+ strlen_rec_~p.offset 2) .cse0) (= 0 |strlen_rec_#t~mem2|) (<= .cse0 strlen_rec_~p.offset)))) [2020-07-29 00:52:09,898 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 00:52:10,051 INFO L263 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2020-07-29 00:52:10,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {3044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3044#true} is VALID [2020-07-29 00:52:10,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2020-07-29 00:52:10,052 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2020-07-29 00:52:10,052 INFO L263 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret9 := main(); {3044#true} is VALID [2020-07-29 00:52:10,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {3044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~length1~0 := #t~nondet4;havoc #t~nondet4; {3044#true} is VALID [2020-07-29 00:52:10,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {3044#true} assume !(~length1~0 < 1); {3044#true} is VALID [2020-07-29 00:52:10,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {3044#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(~length1~0);~nondetString1~0.base, ~nondetString1~0.offset := #t~malloc5.base, #t~malloc5.offset;~i~0 := 0; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,059 INFO L280 TraceCheckUtils]: 14: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} assume !!(~i~0 < ~length1~0 - 1);assume -128 <= #t~nondet7 && #t~nondet7 <= 127; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(#t~nondet7, ~nondetString1~0.base, ~nondetString1~0.offset + ~i~0, 1); srcloc: L529 {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,061 INFO L280 TraceCheckUtils]: 18: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} havoc #t~nondet7; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} assume !(~i~0 < ~length1~0 - 1); {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} is VALID [2020-07-29 00:52:10,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {3090#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 0 main_~nondetString1~0.offset))} SUMMARY for call write~int(0, ~nondetString1~0.base, ~nondetString1~0.offset + (~length1~0 - 1), 1); srcloc: L527-4 {3133#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (<= 0 main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base) (- 1))))))} is VALID [2020-07-29 00:52:10,065 INFO L263 TraceCheckUtils]: 22: Hoare triple {3133#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (<= 0 main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base) (- 1))))))} call #t~ret8 := strlen_rec(~nondetString1~0.base, ~nondetString1~0.offset); {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,066 INFO L280 TraceCheckUtils]: 23: Hoare triple {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,067 INFO L280 TraceCheckUtils]: 24: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,068 INFO L280 TraceCheckUtils]: 25: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} assume !(0 == #t~mem2);havoc #t~mem2; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,069 INFO L263 TraceCheckUtils]: 26: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,070 INFO L280 TraceCheckUtils]: 27: Hoare triple {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,071 INFO L280 TraceCheckUtils]: 28: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,071 INFO L280 TraceCheckUtils]: 29: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} assume !(0 == #t~mem2);havoc #t~mem2; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,072 INFO L263 TraceCheckUtils]: 30: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,073 INFO L280 TraceCheckUtils]: 31: Hoare triple {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,074 INFO L280 TraceCheckUtils]: 32: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,074 INFO L280 TraceCheckUtils]: 33: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} assume !(0 == #t~mem2);havoc #t~mem2; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,075 INFO L263 TraceCheckUtils]: 34: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,076 INFO L280 TraceCheckUtils]: 35: Hoare triple {3137#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~0.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~0.offset)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} is VALID [2020-07-29 00:52:10,077 INFO L280 TraceCheckUtils]: 36: Hoare triple {3141#(exists ((main_~nondetString1~0.offset Int)) (and (<= main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~0.offset (- 1)))) (<= 0 main_~nondetString1~0.offset)))} SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 1); srcloc: L515 {3181#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset) (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (= 0 |strlen_rec_#t~mem2|)))} is VALID [2020-07-29 00:52:10,078 INFO L280 TraceCheckUtils]: 37: Hoare triple {3181#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset) (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (= 0 |strlen_rec_#t~mem2|)))} assume !(0 == #t~mem2);havoc #t~mem2; {3185#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} is VALID [2020-07-29 00:52:10,079 INFO L263 TraceCheckUtils]: 38: Hoare triple {3185#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {3189#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} is VALID [2020-07-29 00:52:10,079 INFO L280 TraceCheckUtils]: 39: Hoare triple {3189#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {3193#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2020-07-29 00:52:10,080 INFO L280 TraceCheckUtils]: 40: Hoare triple {3193#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} assume !(1 + ~p.offset <= #length[~p.base] && 0 <= ~p.offset); {3045#false} is VALID [2020-07-29 00:52:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-29 00:52:10,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:52:10,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 27 [2020-07-29 00:52:10,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214488618] [2020-07-29 00:52:10,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2020-07-29 00:52:10,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:52:10,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-29 00:52:10,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:10,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-29 00:52:10,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:52:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-29 00:52:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2020-07-29 00:52:10,168 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 27 states. [2020-07-29 00:52:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:14,871 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-07-29 00:52:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-29 00:52:14,871 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2020-07-29 00:52:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:52:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 00:52:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-07-29 00:52:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 00:52:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-07-29 00:52:14,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2020-07-29 00:52:14,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:52:14,998 INFO L225 Difference]: With dead ends: 65 [2020-07-29 00:52:14,998 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 00:52:15,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=380, Invalid=2926, Unknown=0, NotChecked=0, Total=3306 [2020-07-29 00:52:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 00:52:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 00:52:15,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:52:15,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 00:52:15,001 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:52:15,001 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:52:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:15,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:52:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:52:15,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:15,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:15,001 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:52:15,002 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:52:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:52:15,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:52:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:52:15,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:15,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:52:15,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:52:15,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:52:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 00:52:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 00:52:15,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-29 00:52:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:52:15,003 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 00:52:15,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-29 00:52:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:52:15,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:52:15,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-29 00:52:15,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 12:52:15 BoogieIcfgContainer [2020-07-29 00:52:15,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 00:52:15,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 00:52:15,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 00:52:15,214 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 00:52:15,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:51:47" (3/4) ... [2020-07-29 00:52:15,218 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 00:52:15,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 00:52:15,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2020-07-29 00:52:15,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 00:52:15,230 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-07-29 00:52:15,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-29 00:52:15,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 00:52:15,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 00:52:15,275 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 00:52:15,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 00:52:15,277 INFO L168 Benchmark]: Toolchain (without parser) took 29524.61 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.7 MB). Free memory was 961.6 MB in the beginning and 1.4 GB in the end (delta: -397.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. [2020-07-29 00:52:15,278 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:52:15,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-29 00:52:15,279 INFO L168 Benchmark]: Boogie Preprocessor took 127.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:52:15,279 INFO L168 Benchmark]: RCFGBuilder took 713.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2020-07-29 00:52:15,280 INFO L168 Benchmark]: TraceAbstraction took 27964.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.5 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. [2020-07-29 00:52:15,280 INFO L168 Benchmark]: Witness Printer took 61.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:52:15,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 713.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27964.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.5 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 48 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.8s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 573 SDslu, 812 SDs, 0 SdLazy, 2974 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 54 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 518 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 495 ConstructedInterpolants, 22 QuantifiedInterpolants, 102633 SizeOfPredicates, 66 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 91/268 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...