./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.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/rec_strlen-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 1f736ad3d73bcf44f292b11858e0429161a038cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:14:04,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:14:04,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:14:04,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:14:04,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:14:04,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:14:04,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:14:04,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:14:04,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:14:04,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:14:04,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:14:04,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:14:04,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:14:04,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:14:04,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:14:04,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:14:04,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:14:04,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:14:04,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:14:04,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:14:04,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:14:04,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:14:04,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:14:04,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:14:04,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:14:04,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:14:04,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:14:04,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:14:04,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:14:04,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:14:04,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:14:04,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:14:04,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:14:04,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:14:04,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:14:04,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:14:04,193 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:14:04,223 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:14:04,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:14:04,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:14:04,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:14:04,228 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:14:04,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:14:04,229 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:14:04,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:14:04,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:14:04,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:14:04,231 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:14:04,231 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:14:04,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:14:04,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:14:04,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:14:04,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:14:04,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:14:04,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:14:04,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:14:04,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:14:04,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:14:04,235 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 -> 1f736ad3d73bcf44f292b11858e0429161a038cf [2019-01-01 17:14:04,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:14:04,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:14:04,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:14:04,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:14:04,299 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:14:04,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:04,359 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102e6220d/c782f9849d67498588e3da7e6a1175b7/FLAG12562f26a [2019-01-01 17:14:04,906 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:14:04,908 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:04,925 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102e6220d/c782f9849d67498588e3da7e6a1175b7/FLAG12562f26a [2019-01-01 17:14:05,159 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102e6220d/c782f9849d67498588e3da7e6a1175b7 [2019-01-01 17:14:05,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:14:05,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:14:05,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:05,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:14:05,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:14:05,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8af47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05, skipping insertion in model container [2019-01-01 17:14:05,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:14:05,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:14:05,600 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:05,611 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:14:05,729 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:05,789 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:14:05,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05 WrapperNode [2019-01-01 17:14:05,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:05,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:14:05,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:14:05,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:14:05,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (1/1) ... [2019-01-01 17:14:05,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:14:05,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:14:05,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:14:05,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:14:05,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (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:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-01-01 17:14:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:14:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:14:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:14:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:14:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:14:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:14:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:14:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:14:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:14:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:14:05,930 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:14:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:14:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:14:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:14:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:14:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:14:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:14:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:14:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:14:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:14:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:14:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:14:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:14:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:14:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:14:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:14:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:14:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:14:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:14:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:14:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:14:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:14:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:14:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:14:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:14:06,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:14:06,556 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:14:06,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:06 BoogieIcfgContainer [2019-01-01 17:14:06,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:14:06,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:14:06,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:14:06,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:14:06,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:14:05" (1/3) ... [2019-01-01 17:14:06,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3749846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:06, skipping insertion in model container [2019-01-01 17:14:06,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:05" (2/3) ... [2019-01-01 17:14:06,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3749846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:06, skipping insertion in model container [2019-01-01 17:14:06,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:06" (3/3) ... [2019-01-01 17:14:06,566 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:06,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:14:06,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-01 17:14:06,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-01 17:14:06,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:14:06,637 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:14:06,638 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:14:06,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:14:06,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:14:06,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:14:06,639 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:14:06,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:14:06,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:14:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-01 17:14:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:14:06,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:06,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:06,669 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1068560237, now seen corresponding path program 1 times [2019-01-01 17:14:06,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:06,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:06,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:06,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:06,846 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:14:06,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:06,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:06,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:06,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:06,868 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-01-01 17:14:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:06,940 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-01 17:14:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:06,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 17:14:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:06,952 INFO L225 Difference]: With dead ends: 26 [2019-01-01 17:14:06,953 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 17:14:06,955 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:14:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 17:14:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 17:14:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 17:14:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-01-01 17:14:06,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2019-01-01 17:14:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:06,999 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-01 17:14:06,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-01-01 17:14:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:14:07,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:07,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:07,000 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1068560238, now seen corresponding path program 1 times [2019-01-01 17:14:07,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:07,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:07,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:07,163 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:14:07,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:07,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:07,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:07,166 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-01-01 17:14:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:07,213 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-01-01 17:14:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:07,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-01 17:14:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:07,215 INFO L225 Difference]: With dead ends: 22 [2019-01-01 17:14:07,215 INFO L226 Difference]: Without dead ends: 22 [2019-01-01 17:14:07,220 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:14:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-01 17:14:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-01 17:14:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 17:14:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-01 17:14:07,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2019-01-01 17:14:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:07,225 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 17:14:07,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-01 17:14:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 17:14:07,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:07,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:07,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:07,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash -819572967, now seen corresponding path program 1 times [2019-01-01 17:14:07,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:07,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:07,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:07,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:07,318 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:14:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:14:07,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:14:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:14:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:14:07,320 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-01-01 17:14:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:07,554 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-01-01 17:14:07,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:14:07,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-01 17:14:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:07,556 INFO L225 Difference]: With dead ends: 21 [2019-01-01 17:14:07,556 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 17:14:07,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 17:14:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-01 17:14:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 17:14:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-01 17:14:07,562 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2019-01-01 17:14:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:07,564 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-01 17:14:07,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:14:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-01 17:14:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 17:14:07,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:07,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:07,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -819572966, now seen corresponding path program 1 times [2019-01-01 17:14:07,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:07,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:07,734 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:14:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:07,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:14:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:14:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:14:07,736 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2019-01-01 17:14:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:07,822 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-01 17:14:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:14:07,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 17:14:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:07,827 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:14:07,827 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:14:07,828 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-01 17:14:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:14:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 17:14:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 17:14:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-01 17:14:07,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2019-01-01 17:14:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:07,835 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-01 17:14:07,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:14:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-01 17:14:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:14:07,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:07,836 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:07,836 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 650529540, now seen corresponding path program 1 times [2019-01-01 17:14:07,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:08,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:08,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:14:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:14:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:14:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:14:08,153 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2019-01-01 17:14:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:08,539 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-01-01 17:14:08,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:14:08,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:14:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:08,541 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:14:08,542 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:14:08,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:14:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:14:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-01 17:14:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:14:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-01 17:14:08,551 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 16 [2019-01-01 17:14:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:08,551 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-01 17:14:08,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:14:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-01 17:14:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:14:08,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:08,552 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:08,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash 257502530, now seen corresponding path program 1 times [2019-01-01 17:14:08,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:08,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:08,922 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:14:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:08,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:09,076 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-01 17:14:09,093 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-01 17:14:09,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:09,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:09,224 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-01 17:14:09,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:09,557 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-01 17:14:09,584 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-01 17:14:09,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:09,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:09,666 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-01 17:14:09,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-01 17:14:09,844 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2019-01-01 17:14:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:09,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:09,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-01 17:14:09,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:14:09,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:14:09,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:14:09,915 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 16 states. [2019-01-01 17:14:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:10,550 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-01 17:14:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:14:10,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-01 17:14:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:10,553 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:14:10,554 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:14:10,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:14:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:14:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-01-01 17:14:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:14:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-01 17:14:10,562 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2019-01-01 17:14:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:10,562 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-01 17:14:10,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:14:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-01 17:14:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:14:10,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:10,568 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:14:10,568 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1309508822, now seen corresponding path program 1 times [2019-01-01 17:14:10,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:10,647 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:14:10,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:10,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:10,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:10,648 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-01-01 17:14:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:10,750 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-01 17:14:10,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:10,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-01 17:14:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:10,753 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:14:10,753 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 17:14:10,753 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-01 17:14:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 17:14:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-01-01 17:14:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 17:14:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-01 17:14:10,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2019-01-01 17:14:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:10,757 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-01 17:14:10,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-01 17:14:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:14:10,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:10,758 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:10,758 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash 948819244, now seen corresponding path program 2 times [2019-01-01 17:14:10,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:10,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:10,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:10,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:10,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:11,214 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-01-01 17:14:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:11,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:11,374 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-01 17:14:11,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:11,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:11,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:11,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:11,450 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:14:11,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:11,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:11,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:14:11,508 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-01 17:14:11,510 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-01 17:14:11,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:11,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:11,524 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-01 17:14:11,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-01 17:14:11,735 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-01 17:14:11,743 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-01 17:14:11,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:11,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:11,764 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-01 17:14:11,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:39 [2019-01-01 17:14:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2019-01-01 17:14:11,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:14:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:14:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:14:11,860 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-01 17:14:12,350 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-01-01 17:14:12,504 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-01 17:14:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:12,879 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-01 17:14:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:14:12,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-01 17:14:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:12,881 INFO L225 Difference]: With dead ends: 22 [2019-01-01 17:14:12,881 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:14:12,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2019-01-01 17:14:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:14:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:14:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:14:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:14:12,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-01-01 17:14:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:12,883 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:14:12,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:14:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:14:12,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:14:12,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:12 BoogieIcfgContainer [2019-01-01 17:14:12,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:12,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:12,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:12,889 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:12,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:06" (3/4) ... [2019-01-01 17:14:12,892 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:14:12,898 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:14:12,898 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:14:12,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:14:12,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:14:12,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2019-01-01 17:14:12,904 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-01 17:14:12,904 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 17:14:12,904 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 17:14:12,951 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:12,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:12,954 INFO L168 Benchmark]: Toolchain (without parser) took 7791.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -97.4 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:12,955 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-01 17:14:12,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:12,956 INFO L168 Benchmark]: Boogie Preprocessor took 58.71 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:14:12,956 INFO L168 Benchmark]: RCFGBuilder took 706.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:12,959 INFO L168 Benchmark]: TraceAbstraction took 6330.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:12,960 INFO L168 Benchmark]: Witness Printer took 64.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 17:14:12,968 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 626.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.71 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 706.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6330.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. * Witness Printer took 64.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: 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, 6.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 126 SDslu, 495 SDs, 0 SdLazy, 468 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 10 QuantifiedInterpolants, 15625 SizeOfPredicates, 16 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...