./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrchr_unsafe_false-valid-deref.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 b1c981e5c0ba7a15ac143c5240d22ecf11476d0a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:12:34,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:12:34,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:12:34,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:12:34,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:12:34,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:12:34,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:12:34,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:12:34,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:12:34,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:12:34,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:12:34,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:12:34,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:12:34,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:12:34,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:12:34,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:12:34,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:12:34,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:12:34,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:12:34,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:12:34,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:12:34,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:12:34,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:12:34,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:12:34,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:12:34,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:12:34,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:12:34,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:12:34,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:12:34,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:12:34,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:12:34,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:12:34,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:12:34,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:12:34,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:12:34,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:12:34,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:12:34,796 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:12:34,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:12:34,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:12:34,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:12:34,798 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:12:34,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:12:34,799 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:12:34,799 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:12:34,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:12:34,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:12:34,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:12:34,800 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:12:34,800 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:12:34,801 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:12:34,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:12:34,801 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:12:34,801 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:12:34,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:12:34,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:12:34,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:12:34,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:12:34,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:34,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:12:34,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:12:34,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:12:34,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:12:34,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> b1c981e5c0ba7a15ac143c5240d22ecf11476d0a [2019-01-01 17:12:34,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:12:34,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:12:34,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:12:34,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:12:34,875 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:12:34,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2019-01-01 17:12:34,939 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d16971/115fe25bf7d54970b663c40913244b8b/FLAG84f53c6f3 [2019-01-01 17:12:35,518 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:12:35,519 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2019-01-01 17:12:35,534 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d16971/115fe25bf7d54970b663c40913244b8b/FLAG84f53c6f3 [2019-01-01 17:12:35,745 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d16971/115fe25bf7d54970b663c40913244b8b [2019-01-01 17:12:35,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:12:35,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:12:35,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:35,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:12:35,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:12:35,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:35" (1/1) ... [2019-01-01 17:12:35,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420f99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:35, skipping insertion in model container [2019-01-01 17:12:35,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:35" (1/1) ... [2019-01-01 17:12:35,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:12:35,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:12:36,258 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:36,269 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:12:36,398 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:36,458 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:12:36,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36 WrapperNode [2019-01-01 17:12:36,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:36,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:12:36,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:12:36,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:12:36,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... [2019-01-01 17:12:36,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:12:36,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:12:36,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:12:36,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:12:36,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:36,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:12:36,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:12:36,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:12:36,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:12:36,611 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2019-01-01 17:12:36,612 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2019-01-01 17:12:36,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:12:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:12:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:12:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:12:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:12:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:12:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:12:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:12:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:12:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:12:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:12:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:12:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:12:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:12:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:12:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:12:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:12:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:12:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:12:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:12:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:12:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:12:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:12:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:12:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:12:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:12:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:12:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:12:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:12:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:12:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:12:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:12:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:12:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:12:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:12:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:12:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:12:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:12:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:12:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:12:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:12:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:12:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:12:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:12:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2019-01-01 17:12:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:12:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:12:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:12:37,405 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:12:37,405 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:12:37,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:37 BoogieIcfgContainer [2019-01-01 17:12:37,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:12:37,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:12:37,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:12:37,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:12:37,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:12:35" (1/3) ... [2019-01-01 17:12:37,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700dc602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:37, skipping insertion in model container [2019-01-01 17:12:37,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:36" (2/3) ... [2019-01-01 17:12:37,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700dc602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:37, skipping insertion in model container [2019-01-01 17:12:37,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:37" (3/3) ... [2019-01-01 17:12:37,415 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2019-01-01 17:12:37,426 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:12:37,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-01-01 17:12:37,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-01-01 17:12:37,488 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:12:37,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:12:37,489 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:12:37,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:12:37,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:12:37,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:12:37,491 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:12:37,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:12:37,493 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:12:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-01-01 17:12:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:37,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:37,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:37,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1449667296, now seen corresponding path program 1 times [2019-01-01 17:12:37,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:37,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:37,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:12:37,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:37,737 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-01-01 17:12:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:37,854 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-01 17:12:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:37,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:12:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:37,866 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:12:37,866 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 17:12:37,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 17:12:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-01 17:12:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 17:12:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-01-01 17:12:37,909 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 10 [2019-01-01 17:12:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:37,909 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-01-01 17:12:37,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-01-01 17:12:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:37,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:37,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:37,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1449667295, now seen corresponding path program 1 times [2019-01-01 17:12:37,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:38,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:38,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:38,070 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-01-01 17:12:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:38,113 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-01-01 17:12:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:38,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:12:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:38,115 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:12:38,115 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:12:38,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:12:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:12:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:12:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-01 17:12:38,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2019-01-01 17:12:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:38,125 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-01 17:12:38,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-01 17:12:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:12:38,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:38,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:38,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:38,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2079958937, now seen corresponding path program 1 times [2019-01-01 17:12:38,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:38,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:38,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:38,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:12:38,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:12:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:12:38,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:38,427 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2019-01-01 17:12:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:39,004 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-01-01 17:12:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:12:39,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 17:12:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:39,008 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:12:39,008 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:12:39,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:12:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:12:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:12:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-01 17:12:39,015 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2019-01-01 17:12:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:39,015 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-01 17:12:39,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:12:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-01 17:12:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:12:39,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:39,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:39,017 INFO L423 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2079958936, now seen corresponding path program 1 times [2019-01-01 17:12:39,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:39,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:39,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:39,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:12:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:12:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:12:39,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:39,237 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2019-01-01 17:12:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:39,582 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-01-01 17:12:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:12:39,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-01-01 17:12:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:39,587 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:12:39,587 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:12:39,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:12:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:12:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-01 17:12:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:12:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-01-01 17:12:39,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 17 [2019-01-01 17:12:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:39,596 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-01-01 17:12:39,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:12:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-01-01 17:12:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:12:39,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:39,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:39,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash -289694977, now seen corresponding path program 1 times [2019-01-01 17:12:39,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:39,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:39,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:39,647 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2019-01-01 17:12:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:39,667 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-01 17:12:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-01 17:12:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:39,671 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:12:39,671 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:12:39,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:12:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 17:12:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:12:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-01-01 17:12:39,678 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 21 [2019-01-01 17:12:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:39,678 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-01-01 17:12:39,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-01-01 17:12:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:12:39,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:39,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:39,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash 770140924, now seen corresponding path program 1 times [2019-01-01 17:12:39,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 17:12:40,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:12:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:12:40,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:12:40,015 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 12 states. [2019-01-01 17:12:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:40,344 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-01-01 17:12:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:12:40,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-01 17:12:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:40,347 INFO L225 Difference]: With dead ends: 76 [2019-01-01 17:12:40,347 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 17:12:40,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:12:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 17:12:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-01-01 17:12:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 17:12:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-01-01 17:12:40,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 23 [2019-01-01 17:12:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:40,359 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-01-01 17:12:40,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:12:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-01-01 17:12:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:12:40,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:40,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:40,361 INFO L423 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash -250927430, now seen corresponding path program 1 times [2019-01-01 17:12:40,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:40,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:12:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:40,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:40,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:12:40,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:40,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:40,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:12:41,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:12:41,058 INFO L478 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 12 treesize of output 11 [2019-01-01 17:12:41,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:41,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:41,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:41,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 17:12:41,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 17:12:41,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:12:41,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:12:41,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:12:41,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:12:41,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-01 17:12:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:41,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:12:41,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-01-01 17:12:41,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:12:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:12:41,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:12:41,755 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 24 states. [2019-01-01 17:12:42,753 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 17:12:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:43,821 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2019-01-01 17:12:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:12:43,822 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-01-01 17:12:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:43,824 INFO L225 Difference]: With dead ends: 77 [2019-01-01 17:12:43,824 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 17:12:43,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 17:12:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 17:12:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2019-01-01 17:12:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 17:12:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-01 17:12:43,832 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 23 [2019-01-01 17:12:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-01 17:12:43,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:12:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-01 17:12:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:12:43,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:43,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:43,834 INFO L423 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1170261081, now seen corresponding path program 1 times [2019-01-01 17:12:43,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:43,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:43,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:43,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:12:43,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:12:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:12:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:43,958 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 10 states. [2019-01-01 17:12:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:44,146 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-01-01 17:12:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:12:44,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-01 17:12:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:44,149 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:12:44,149 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 17:12:44,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:12:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 17:12:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-01 17:12:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 17:12:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-01-01 17:12:44,157 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 26 [2019-01-01 17:12:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:44,160 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-01-01 17:12:44,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:12:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-01-01 17:12:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:12:44,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:44,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:44,161 INFO L423 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1170261082, now seen corresponding path program 1 times [2019-01-01 17:12:44,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:12:44,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:12:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:12:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:12:44,357 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 11 states. [2019-01-01 17:12:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:44,671 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-01 17:12:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:12:44,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-01 17:12:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:44,676 INFO L225 Difference]: With dead ends: 79 [2019-01-01 17:12:44,677 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 17:12:44,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:12:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 17:12:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-01-01 17:12:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 17:12:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-01-01 17:12:44,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 26 [2019-01-01 17:12:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:44,696 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-01 17:12:44,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:12:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-01-01 17:12:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:12:44,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:44,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:44,700 INFO L423 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr0REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:12:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1172108123, now seen corresponding path program 1 times [2019-01-01 17:12:44,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:12:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:12:44,776 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:12:44,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:12:44 BoogieIcfgContainer [2019-01-01 17:12:44,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:12:44,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:12:44,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:12:44,818 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:12:44,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:37" (3/4) ... [2019-01-01 17:12:44,824 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 17:12:44,917 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:12:44,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:12:44,918 INFO L168 Benchmark]: Toolchain (without parser) took 9169.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 950.0 MB in the beginning and 936.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 211.1 MB. Max. memory is 11.5 GB. [2019-01-01 17:12:44,919 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:12:44,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:12:44,921 INFO L168 Benchmark]: Boogie Preprocessor took 76.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:12:44,921 INFO L168 Benchmark]: RCFGBuilder took 869.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:12:44,924 INFO L168 Benchmark]: TraceAbstraction took 7410.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 936.1 MB in the end (delta: 116.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:12:44,925 INFO L168 Benchmark]: Witness Printer took 99.11 ms. Allocated memory is still 1.2 GB. Free memory is still 936.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:12:44,934 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 709.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 869.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7410.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 936.1 MB in the end (delta: 116.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. * Witness Printer took 99.11 ms. Allocated memory is still 1.2 GB. Free memory is still 936.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 557]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={2:0}, nondetString={2:0}] [L546] nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={2:0}, nondetString={2:0}] [L547] return nondetString; VAL [\result={2:0}, length=1, malloc(length * sizeof(char))={2:0}, nondetString={2:0}] [L556] RET, EXPR build_nondet_String() VAL [build_nondet_String()={2:0}] [L556] char* s = build_nondet_String(); [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={2:0}] [L551] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={2:0}, s={2:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={2:0}, s={2:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) [L553] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={2:0}, s={2:0}] [L553] EXPR (*s == c) ? (char *) s : 0 VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={2:0}, s={2:0}] [L553] return ( (*s == c) ? (char *) s : 0 ); [L557] RET cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 56 locations, 14 error locations. UNSAFE Result, 7.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 295 SDtfs, 394 SDslu, 1354 SDs, 0 SdLazy, 1385 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 19807 SizeOfPredicates, 9 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...