./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.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 693983fd65e20b5d89b8cfa65a19d47075cafd63 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:34,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:34,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:34,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:34,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:34,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:34,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:34,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:34,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:34,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:34,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:34,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:34,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:34,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:34,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:34,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:34,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:34,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:34,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:34,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:34,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:34,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:34,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:34,940 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:34,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:34,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:34,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:34,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:34,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:34,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:34,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:34,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:34,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:34,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:34,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:34,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:34,959 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:34,983 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:34,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:34,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:34,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:34,985 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:34,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:34,986 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:34,988 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:34,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:34,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:34,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:34,989 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:34,989 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:34,989 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:34,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:34,990 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:34,990 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:34,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:34,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:34,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:34,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:34,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:34,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:34,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:34,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:34,993 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:34,993 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 -> 693983fd65e20b5d89b8cfa65a19d47075cafd63 [2019-01-13 21:56:35,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:35,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:35,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:35,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:35,045 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:35,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:35,103 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c224839bc/533d62cb2b7546d8bf237d7b3ad9557c/FLAGb9d803322 [2019-01-13 21:56:35,592 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:35,592 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:35,604 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c224839bc/533d62cb2b7546d8bf237d7b3ad9557c/FLAGb9d803322 [2019-01-13 21:56:35,918 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c224839bc/533d62cb2b7546d8bf237d7b3ad9557c [2019-01-13 21:56:35,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:35,924 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:35,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:35,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:35,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:35,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:35" (1/1) ... [2019-01-13 21:56:35,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21213c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:35, skipping insertion in model container [2019-01-13 21:56:35,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:35" (1/1) ... [2019-01-13 21:56:35,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:35,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:36,297 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:36,314 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:36,389 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:36,519 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:36,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36 WrapperNode [2019-01-13 21:56:36,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:36,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:36,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:36,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:36,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (1/1) ... [2019-01-13 21:56:36,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:36,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:36,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:36,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:36,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56: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-13 21:56:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-01-13 21:56:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:36,661 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:37,259 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:37,259 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:56:37,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:37 BoogieIcfgContainer [2019-01-13 21:56:37,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:37,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:37,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:37,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:37,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:35" (1/3) ... [2019-01-13 21:56:37,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:37, skipping insertion in model container [2019-01-13 21:56:37,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:36" (2/3) ... [2019-01-13 21:56:37,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:37, skipping insertion in model container [2019-01-13 21:56:37,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:37" (3/3) ... [2019-01-13 21:56:37,268 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:37,278 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:37,287 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-13 21:56:37,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-13 21:56:37,330 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:37,331 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:37,331 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:37,331 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:37,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:37,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:37,332 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:37,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:37,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-13 21:56:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 21:56:37,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:37,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1008915917, now seen corresponding path program 1 times [2019-01-13 21:56:37,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,537 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-13 21:56:37,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:37,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:37,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:37,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:37,556 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-01-13 21:56:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:37,638 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-13 21:56:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:37,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-13 21:56:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:37,651 INFO L225 Difference]: With dead ends: 26 [2019-01-13 21:56:37,651 INFO L226 Difference]: Without dead ends: 23 [2019-01-13 21:56:37,654 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-13 21:56:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-13 21:56:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-13 21:56:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-13 21:56:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-13 21:56:37,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2019-01-13 21:56:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:37,694 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-13 21:56:37,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-13 21:56:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 21:56:37,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:37,695 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1008915916, now seen corresponding path program 1 times [2019-01-13 21:56:37,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,022 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-13 21:56:38,024 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-13 21:56:38,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:38,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:38,030 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 4 states. [2019-01-13 21:56:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,085 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-13 21:56:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:38,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-13 21:56:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,087 INFO L225 Difference]: With dead ends: 22 [2019-01-13 21:56:38,087 INFO L226 Difference]: Without dead ends: 22 [2019-01-13 21:56:38,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-13 21:56:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-13 21:56:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-13 21:56:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-13 21:56:38,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 9 [2019-01-13 21:56:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,093 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-13 21:56:38,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-13 21:56:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 21:56:38,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:38,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash -432933794, now seen corresponding path program 1 times [2019-01-13 21:56:38,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,229 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-13 21:56:38,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:38,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:38,231 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2019-01-13 21:56:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,435 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-13 21:56:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:38,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-13 21:56:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,438 INFO L225 Difference]: With dead ends: 21 [2019-01-13 21:56:38,438 INFO L226 Difference]: Without dead ends: 21 [2019-01-13 21:56:38,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-13 21:56:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-13 21:56:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-13 21:56:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-13 21:56:38,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2019-01-13 21:56:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,444 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-13 21:56:38,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-13 21:56:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 21:56:38,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:38,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash -432933793, now seen corresponding path program 1 times [2019-01-13 21:56:38,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,609 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-13 21:56:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:38,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:38,611 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-01-13 21:56:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,714 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-01-13 21:56:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:38,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-13 21:56:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,720 INFO L225 Difference]: With dead ends: 27 [2019-01-13 21:56:38,720 INFO L226 Difference]: Without dead ends: 27 [2019-01-13 21:56:38,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-13 21:56:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-13 21:56:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-13 21:56:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-13 21:56:38,726 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-01-13 21:56:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,727 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-13 21:56:38,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-13 21:56:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:38,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:38,728 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash 256132890, now seen corresponding path program 1 times [2019-01-13 21:56:38,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,085 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2019-01-13 21:56:39,223 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-13 21:56:39,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:39,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:56:39,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:39,225 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2019-01-13 21:56:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:39,415 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-13 21:56:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:39,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 21:56:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:39,420 INFO L225 Difference]: With dead ends: 34 [2019-01-13 21:56:39,420 INFO L226 Difference]: Without dead ends: 34 [2019-01-13 21:56:39,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-13 21:56:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-13 21:56:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-13 21:56:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-13 21:56:39,427 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 15 [2019-01-13 21:56:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:39,428 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-13 21:56:39,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-13 21:56:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:39,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:39,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:39,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 936191260, now seen corresponding path program 1 times [2019-01-13 21:56:39,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,717 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-13 21:56:39,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:39,718 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-13 21:56:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:39,817 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 14 treesize of output 11 [2019-01-13 21:56:39,823 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 11 treesize of output 10 [2019-01-13 21:56:39,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:39,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:39,856 INFO L267 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. [2019-01-13 21:56:39,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:40,087 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 18 treesize of output 14 [2019-01-13 21:56:40,108 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 14 treesize of output 11 [2019-01-13 21:56:40,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-13 21:56:40,387 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-13 21:56:40,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:40,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-01-13 21:56:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 21:56:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 21:56:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:40,408 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2019-01-13 21:56:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:41,062 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-13 21:56:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:56:41,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-13 21:56:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:41,065 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:41,066 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:41,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:56:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-01-13 21:56:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 21:56:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-01-13 21:56:41,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2019-01-13 21:56:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:41,074 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-01-13 21:56:41,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 21:56:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-01-13 21:56:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:41,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:41,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:41,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1755122930, now seen corresponding path program 1 times [2019-01-13 21:56:41,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:41,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:41,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:41,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:41,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:41,167 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-13 21:56:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:41,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:41,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:41,169 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 4 states. [2019-01-13 21:56:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:41,230 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-13 21:56:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:41,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-13 21:56:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:41,231 INFO L225 Difference]: With dead ends: 33 [2019-01-13 21:56:41,232 INFO L226 Difference]: Without dead ends: 19 [2019-01-13 21:56:41,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-13 21:56:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-13 21:56:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-13 21:56:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-13 21:56:41,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2019-01-13 21:56:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:41,235 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-13 21:56:41,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-13 21:56:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:41,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:41,237 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:41,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1443823299, now seen corresponding path program 2 times [2019-01-13 21:56:41,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:41,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:41,522 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-13 21:56:41,765 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2019-01-13 21:56:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:41,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:41,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:41,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:41,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:41,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:41,904 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-13 21:56:41,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 21:56:41,958 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 16 treesize of output 13 [2019-01-13 21:56:41,962 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 13 treesize of output 12 [2019-01-13 21:56:41,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-13 21:56:42,122 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 20 treesize of output 16 [2019-01-13 21:56:42,171 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 16 treesize of output 13 [2019-01-13 21:56:42,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:42,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:42,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:42,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-13 21:56:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:42,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:42,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-13 21:56:42,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 21:56:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 21:56:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-01-13 21:56:42,343 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2019-01-13 21:56:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:43,069 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-13 21:56:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:43,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-01-13 21:56:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:43,072 INFO L225 Difference]: With dead ends: 20 [2019-01-13 21:56:43,072 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:43,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-01-13 21:56:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:43,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-13 21:56:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:43,074 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:43,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 21:56:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:43,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:43,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:43 BoogieIcfgContainer [2019-01-13 21:56:43,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:43,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:43,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:43,080 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:43,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:37" (3/4) ... [2019-01-13 21:56:43,084 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:43,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:43,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:43,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:43,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2019-01-13 21:56:43,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:43,095 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-13 21:56:43,095 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-13 21:56:43,096 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:56:43,141 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:43,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:43,142 INFO L168 Benchmark]: Toolchain (without parser) took 7219.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,143 INFO L168 Benchmark]: CDTParser took 0.17 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-13 21:56:43,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,144 INFO L168 Benchmark]: Boogie Preprocessor took 66.44 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,144 INFO L168 Benchmark]: RCFGBuilder took 673.39 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,145 INFO L168 Benchmark]: TraceAbstraction took 5817.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.3 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,146 INFO L168 Benchmark]: Witness Printer took 61.43 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:43,149 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.17 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 595.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.44 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 673.39 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5817.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.3 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. * Witness Printer took 61.43 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 5 error locations. SAFE Result, 5.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 138 SDslu, 387 SDs, 0 SdLazy, 376 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=6, 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, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 8 QuantifiedInterpolants, 12956 SizeOfPredicates, 14 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 2/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...