./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:20:42,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:20:42,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:20:43,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:20:43,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:20:43,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:20:43,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:20:43,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:20:43,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:20:43,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:20:43,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:20:43,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:20:43,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:20:43,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:20:43,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:20:43,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:20:43,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:20:43,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:20:43,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:20:43,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:20:43,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:20:43,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:20:43,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:20:43,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:20:43,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:20:43,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:20:43,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:20:43,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:20:43,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:20:43,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:20:43,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:20:43,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:20:43,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:20:43,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:20:43,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:20:43,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:20:43,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:20:43,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:20:43,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:20:43,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:20:43,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:20:43,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 20:20:43,122 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:20:43,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:20:43,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:20:43,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:20:43,128 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:20:43,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:20:43,131 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:20:43,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:20:43,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:20:43,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:20:43,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:20:43,133 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:20:43,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:20:43,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:20:43,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:20:43,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:20:43,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:20:43,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:20:43,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:20:43,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:20:43,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:20:43,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:43,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:20:43,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:20:43,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:20:43,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:20:43,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:20:43,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-11-28 20:20:43,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:20:43,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:20:43,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:20:43,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:20:43,528 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:20:43,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-28 20:20:43,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a977b9762/dfc03357cd384b478ec6bff12ab3c234/FLAGdffbb33cb [2019-11-28 20:20:44,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:20:44,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-28 20:20:44,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a977b9762/dfc03357cd384b478ec6bff12ab3c234/FLAGdffbb33cb [2019-11-28 20:20:44,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a977b9762/dfc03357cd384b478ec6bff12ab3c234 [2019-11-28 20:20:44,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:20:44,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:20:44,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:44,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:20:44,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:20:44,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2019-11-28 20:20:44,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6d29e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44, skipping insertion in model container [2019-11-28 20:20:44,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2019-11-28 20:20:44,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:20:44,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:20:44,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:44,897 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:20:44,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:45,010 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:20:45,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45 WrapperNode [2019-11-28 20:20:45,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:45,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:20:45,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:20:45,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:20:45,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2019-11-28 20:20:45,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:20:45,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:20:45,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:20:45,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:20:45,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 20:20:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-28 20:20:45,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:20:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:20:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:20:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:20:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:20:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:20:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:20:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:20:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:20:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:20:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:20:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:20:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:20:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:20:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:20:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:20:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:20:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:20:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:20:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:20:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:20:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:20:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:20:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:20:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:20:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:20:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:20:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:20:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:20:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:20:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:20:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:20:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:20:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:20:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:20:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:20:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:20:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:20:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:20:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:20:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:20:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:20:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:20:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:20:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:20:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:20:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:20:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:20:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:20:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:20:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:20:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:20:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:20:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:20:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:20:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:20:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:20:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:20:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:20:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:20:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:20:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:20:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:20:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:20:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:20:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:20:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:20:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:20:45,476 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 20:20:45,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:20:45,873 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:20:45,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45 BoogieIcfgContainer [2019-11-28 20:20:45,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:20:45,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:20:45,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:20:45,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:20:45,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:44" (1/3) ... [2019-11-28 20:20:45,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:45, skipping insertion in model container [2019-11-28 20:20:45,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (2/3) ... [2019-11-28 20:20:45,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:45, skipping insertion in model container [2019-11-28 20:20:45,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45" (3/3) ... [2019-11-28 20:20:45,884 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-11-28 20:20:45,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:20:45,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-11-28 20:20:45,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-11-28 20:20:45,935 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:20:45,935 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:20:45,935 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:20:45,936 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:20:45,936 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:20:45,936 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:20:45,936 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:20:45,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:20:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-28 20:20:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:20:45,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:45,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:45,968 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:45,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155626, now seen corresponding path program 1 times [2019-11-28 20:20:45,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:45,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823642629] [2019-11-28 20:20:45,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:46,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823642629] [2019-11-28 20:20:46,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:46,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:46,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963245232] [2019-11-28 20:20:46,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:46,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:46,220 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 4 states. [2019-11-28 20:20:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:46,725 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-11-28 20:20:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:46,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:20:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:46,747 INFO L225 Difference]: With dead ends: 154 [2019-11-28 20:20:46,748 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 20:20:46,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 20:20:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2019-11-28 20:20:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 20:20:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-11-28 20:20:46,851 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 11 [2019-11-28 20:20:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:46,853 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-11-28 20:20:46,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-11-28 20:20:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:20:46,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:46,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:46,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:46,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155627, now seen corresponding path program 1 times [2019-11-28 20:20:46,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:46,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949505772] [2019-11-28 20:20:46,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:46,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949505772] [2019-11-28 20:20:46,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:46,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:46,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386736644] [2019-11-28 20:20:46,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:46,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:46,993 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 4 states. [2019-11-28 20:20:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:47,357 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2019-11-28 20:20:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:47,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:20:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:47,361 INFO L225 Difference]: With dead ends: 141 [2019-11-28 20:20:47,362 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 20:20:47,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 20:20:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2019-11-28 20:20:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 20:20:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2019-11-28 20:20:47,382 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 11 [2019-11-28 20:20:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:47,383 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2019-11-28 20:20:47,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2019-11-28 20:20:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:20:47,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:47,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:47,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash -892508750, now seen corresponding path program 1 times [2019-11-28 20:20:47,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:47,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069749141] [2019-11-28 20:20:47,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:47,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069749141] [2019-11-28 20:20:47,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:47,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:47,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626429545] [2019-11-28 20:20:47,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:47,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:47,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:47,524 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 7 states. [2019-11-28 20:20:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:47,869 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-28 20:20:47,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:47,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 20:20:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:47,870 INFO L225 Difference]: With dead ends: 101 [2019-11-28 20:20:47,871 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 20:20:47,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 20:20:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-28 20:20:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:20:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-28 20:20:47,881 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 14 [2019-11-28 20:20:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:47,882 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-28 20:20:47,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-28 20:20:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:47,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:47,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:47,884 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 220783085, now seen corresponding path program 1 times [2019-11-28 20:20:47,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:47,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790536183] [2019-11-28 20:20:47,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:47,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790536183] [2019-11-28 20:20:47,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:47,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:47,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878417105] [2019-11-28 20:20:47,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:47,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:47,998 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2019-11-28 20:20:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:48,142 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-28 20:20:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:48,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 20:20:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:48,145 INFO L225 Difference]: With dead ends: 95 [2019-11-28 20:20:48,146 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 20:20:48,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 20:20:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-11-28 20:20:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 20:20:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-28 20:20:48,154 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 20 [2019-11-28 20:20:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:48,155 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-28 20:20:48,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-28 20:20:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:20:48,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:48,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:48,157 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -753815674, now seen corresponding path program 1 times [2019-11-28 20:20:48,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:48,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886708426] [2019-11-28 20:20:48,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:48,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886708426] [2019-11-28 20:20:48,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:48,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:48,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907224741] [2019-11-28 20:20:48,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:48,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:48,378 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 9 states. [2019-11-28 20:20:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:48,862 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-11-28 20:20:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:48,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-28 20:20:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:48,864 INFO L225 Difference]: With dead ends: 94 [2019-11-28 20:20:48,864 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 20:20:48,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 20:20:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-11-28 20:20:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 20:20:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-28 20:20:48,872 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 26 [2019-11-28 20:20:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:48,872 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-28 20:20:48,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-28 20:20:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:20:48,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:48,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:48,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash -753815673, now seen corresponding path program 1 times [2019-11-28 20:20:48,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:48,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213405273] [2019-11-28 20:20:48,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:49,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213405273] [2019-11-28 20:20:49,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806259372] [2019-11-28 20:20:49,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:49,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:20:49,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:49,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:49,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 20:20:49,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345470301] [2019-11-28 20:20:49,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:49,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:49,203 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 9 states. [2019-11-28 20:20:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:49,452 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2019-11-28 20:20:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:49,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-28 20:20:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:49,453 INFO L225 Difference]: With dead ends: 106 [2019-11-28 20:20:49,454 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 20:20:49,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 20:20:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2019-11-28 20:20:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 20:20:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-11-28 20:20:49,460 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2019-11-28 20:20:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:49,460 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-11-28 20:20:49,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-11-28 20:20:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:20:49,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:49,462 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:49,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:49,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1207663810, now seen corresponding path program 1 times [2019-11-28 20:20:49,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:49,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100075338] [2019-11-28 20:20:49,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:49,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100075338] [2019-11-28 20:20:49,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649208092] [2019-11-28 20:20:49,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:49,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:20:49,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:50,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:20:50,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:50,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:50,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:50,032 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:20:50,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:50,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-28 20:20:50,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:50,152 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-28 20:20:50,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:50,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2019-11-28 20:20:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:50,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:50,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 20:20:50,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338514640] [2019-11-28 20:20:50,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:20:50,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:50,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:20:50,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:50,184 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 8 states. [2019-11-28 20:20:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:50,404 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-11-28 20:20:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:50,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-28 20:20:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:50,405 INFO L225 Difference]: With dead ends: 89 [2019-11-28 20:20:50,406 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:20:50,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:20:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 20:20:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:20:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-28 20:20:50,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 32 [2019-11-28 20:20:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:50,411 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-28 20:20:50,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:20:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-28 20:20:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:20:50,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:50,412 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:50,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:50,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1991367515, now seen corresponding path program 2 times [2019-11-28 20:20:50,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:50,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523824560] [2019-11-28 20:20:50,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:50,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523824560] [2019-11-28 20:20:50,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089436426] [2019-11-28 20:20:50,737 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:50,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:20:50,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:20:50,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:20:50,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:50,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:50,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 20:20:50,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997419115] [2019-11-28 20:20:50,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:20:50,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:20:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:50,933 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 12 states. [2019-11-28 20:20:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:51,441 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-11-28 20:20:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:51,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 20:20:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:51,444 INFO L225 Difference]: With dead ends: 117 [2019-11-28 20:20:51,444 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 20:20:51,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:20:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 20:20:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-11-28 20:20:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 20:20:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-11-28 20:20:51,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 38 [2019-11-28 20:20:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:51,451 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-11-28 20:20:51,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:20:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-11-28 20:20:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 20:20:51,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:51,453 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:51,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:51,661 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1388539033, now seen corresponding path program 1 times [2019-11-28 20:20:51,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:51,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409287723] [2019-11-28 20:20:51,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:51,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409287723] [2019-11-28 20:20:51,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220777665] [2019-11-28 20:20:51,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:52,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:20:52,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:52,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:52,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-28 20:20:52,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005258892] [2019-11-28 20:20:52,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:20:52,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:20:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:52,095 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 11 states. [2019-11-28 20:20:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:52,438 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-11-28 20:20:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:52,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-28 20:20:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:52,440 INFO L225 Difference]: With dead ends: 130 [2019-11-28 20:20:52,440 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 20:20:52,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:20:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 20:20:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-28 20:20:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 20:20:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-11-28 20:20:52,446 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 52 [2019-11-28 20:20:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:52,446 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-11-28 20:20:52,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:20:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-11-28 20:20:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 20:20:52,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:52,448 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:52,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:52,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 806592706, now seen corresponding path program 2 times [2019-11-28 20:20:52,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:52,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518243651] [2019-11-28 20:20:52,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:52,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518243651] [2019-11-28 20:20:52,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946704077] [2019-11-28 20:20:52,871 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:53,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:20:53,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:20:53,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:20:53,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:53,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:53,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-28 20:20:53,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004300740] [2019-11-28 20:20:53,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:20:53,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:20:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:53,049 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 12 states. [2019-11-28 20:20:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:53,282 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2019-11-28 20:20:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:53,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-28 20:20:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:53,284 INFO L225 Difference]: With dead ends: 143 [2019-11-28 20:20:53,284 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 20:20:53,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 20:20:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-11-28 20:20:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 20:20:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2019-11-28 20:20:53,290 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 65 [2019-11-28 20:20:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:53,290 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2019-11-28 20:20:53,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:20:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2019-11-28 20:20:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 20:20:53,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:53,292 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:53,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:53,497 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash -810524857, now seen corresponding path program 3 times [2019-11-28 20:20:53,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:53,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869904410] [2019-11-28 20:20:53,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 20:20:53,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869904410] [2019-11-28 20:20:53,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:53,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:53,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255006181] [2019-11-28 20:20:53,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:53,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:53,748 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 9 states. [2019-11-28 20:20:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:54,165 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2019-11-28 20:20:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:54,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-11-28 20:20:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:54,167 INFO L225 Difference]: With dead ends: 163 [2019-11-28 20:20:54,167 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 20:20:54,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 20:20:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2019-11-28 20:20:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 20:20:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2019-11-28 20:20:54,174 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 78 [2019-11-28 20:20:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:54,175 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2019-11-28 20:20:54,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2019-11-28 20:20:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 20:20:54,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:54,177 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:54,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1237334442, now seen corresponding path program 1 times [2019-11-28 20:20:54,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 20:20:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 20:20:54,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 20:20:54,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:54,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:54,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114182411] [2019-11-28 20:20:54,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:54,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:54,390 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 9 states. [2019-11-28 20:20:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:54,839 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2019-11-28 20:20:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:54,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-28 20:20:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:54,842 INFO L225 Difference]: With dead ends: 160 [2019-11-28 20:20:54,842 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 20:20:54,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 20:20:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 20:20:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 20:20:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2019-11-28 20:20:54,853 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 82 [2019-11-28 20:20:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:54,854 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2019-11-28 20:20:54,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2019-11-28 20:20:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-28 20:20:54,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:54,859 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:54,860 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -168861462, now seen corresponding path program 1 times [2019-11-28 20:20:54,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:54,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452937955] [2019-11-28 20:20:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 20:20:55,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452937955] [2019-11-28 20:20:55,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340596060] [2019-11-28 20:20:55,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:55,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 20:20:55,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:55,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:20:55,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-28 20:20:55,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:20:55,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 20:20:55,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-28 20:20:55,593 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-28 20:20:55,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-28 20:20:55,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-28 20:20:55,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 20:20:55,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-28 20:20:55,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 20:20:55,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-28 20:20:55,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 20:20:55,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,737 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,737 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2019-11-28 20:20:55,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:55,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 20:20:55,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:55,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:55,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-28 20:20:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 20:20:55,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:55,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2019-11-28 20:20:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385712522] [2019-11-28 20:20:55,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 20:20:55,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 20:20:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:20:55,919 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 23 states. [2019-11-28 20:20:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:56,969 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2019-11-28 20:20:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:20:56,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-11-28 20:20:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:56,971 INFO L225 Difference]: With dead ends: 160 [2019-11-28 20:20:56,971 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 20:20:56,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:20:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 20:20:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 20:20:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 20:20:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-11-28 20:20:56,975 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 86 [2019-11-28 20:20:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:56,975 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-11-28 20:20:56,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 20:20:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-11-28 20:20:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 20:20:56,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:56,976 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:57,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:57,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1735285809, now seen corresponding path program 1 times [2019-11-28 20:20:57,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:57,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450775779] [2019-11-28 20:20:57,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 20:20:57,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450775779] [2019-11-28 20:20:57,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585887479] [2019-11-28 20:20:57,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:57,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 20:20:57,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:57,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:20:57,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,779 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-28 20:20:57,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:20:57,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-28 20:20:57,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:57,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-28 20:20:57,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-28 20:20:57,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:57,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 20:20:57,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-11-28 20:20:57,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:57,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 20:20:57,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,889 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-11-28 20:20:57,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 20:20:57,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:57,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:57,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2019-11-28 20:20:57,999 INFO L377 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 15 treesize of output 7 [2019-11-28 20:20:58,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:58,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:58,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:58,002 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 20:20:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 20:20:58,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:58,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2019-11-28 20:20:58,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779585308] [2019-11-28 20:20:58,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:20:58,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:20:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:20:58,015 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 21 states. [2019-11-28 20:20:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:59,054 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2019-11-28 20:20:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 20:20:59,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2019-11-28 20:20:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:59,057 INFO L225 Difference]: With dead ends: 160 [2019-11-28 20:20:59,057 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 20:20:59,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:20:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 20:20:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 20:20:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 20:20:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2019-11-28 20:20:59,064 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 88 [2019-11-28 20:20:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:59,065 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2019-11-28 20:20:59,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:20:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2019-11-28 20:20:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 20:20:59,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:59,066 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:59,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:59,271 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:20:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1702130661, now seen corresponding path program 1 times [2019-11-28 20:20:59,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:59,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497393627] [2019-11-28 20:20:59,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 20:20:59,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497393627] [2019-11-28 20:20:59,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946585036] [2019-11-28 20:20:59,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:59,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 20:20:59,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:20:59,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:59,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:20:59,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:59,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:59,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:59,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-28 20:20:59,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:20:59,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:59,971 INFO L614 ElimStorePlain]: treesize reduction 5, result has 82.8 percent of original size [2019-11-28 20:20:59,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:59,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2019-11-28 20:21:00,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:21:00,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-28 20:21:00,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:21:00,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:21:00,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:21:00,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-28 20:21:00,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:21:00,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:21:00,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 110 [2019-11-28 20:21:00,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:21:00,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:21:00,160 INFO L614 ElimStorePlain]: treesize reduction 46, result has 52.6 percent of original size [2019-11-28 20:21:00,161 INFO L534 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-11-28 20:21:00,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-11-28 20:21:00,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:21:00,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:21:00,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2019-11-28 20:21:00,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:21:00,463 INFO L614 ElimStorePlain]: treesize reduction 16, result has 48.4 percent of original size [2019-11-28 20:21:00,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:21:00,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:11 [2019-11-28 20:21:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 20:21:00,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:21:00,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-28 20:21:00,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912875551] [2019-11-28 20:21:00,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 20:21:00,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:21:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 20:21:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:21:00,518 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 29 states. [2019-11-28 20:21:01,605 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-28 20:21:01,998 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-28 20:21:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:21:02,494 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-11-28 20:21:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:21:02,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-11-28 20:21:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:21:02,496 INFO L225 Difference]: With dead ends: 143 [2019-11-28 20:21:02,496 INFO L226 Difference]: Without dead ends: 143 [2019-11-28 20:21:02,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 20:21:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-28 20:21:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-11-28 20:21:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 20:21:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2019-11-28 20:21:02,503 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 89 [2019-11-28 20:21:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:21:02,503 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2019-11-28 20:21:02,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 20:21:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2019-11-28 20:21:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 20:21:02,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:21:02,505 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:21:02,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:21:02,707 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:21:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:21:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1160774828, now seen corresponding path program 1 times [2019-11-28 20:21:02,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:21:02,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766556205] [2019-11-28 20:21:02,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:21:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:21:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:21:02,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:21:02,990 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:21:03,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:21:03 BoogieIcfgContainer [2019-11-28 20:21:03,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:21:03,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:21:03,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:21:03,117 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:21:03,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45" (3/4) ... [2019-11-28 20:21:03,121 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:21:03,259 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:21:03,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:21:03,261 INFO L168 Benchmark]: Toolchain (without parser) took 18866.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -349.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:21:03,262 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:21:03,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:21:03,263 INFO L168 Benchmark]: Boogie Preprocessor took 92.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:21:03,263 INFO L168 Benchmark]: RCFGBuilder took 769.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.2 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:21:03,263 INFO L168 Benchmark]: TraceAbstraction took 17239.21 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 981.2 MB in the beginning and 1.3 GB in the end (delta: -332.5 MB). Peak memory consumption was 517.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:21:03,264 INFO L168 Benchmark]: Witness Printer took 144.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:21:03,271 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 769.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.2 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17239.21 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 981.2 MB in the beginning and 1.3 GB in the end (delta: -332.5 MB). Peak memory consumption was 517.8 MB. Max. memory is 11.5 GB. * Witness Printer took 144.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L577] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] return head; VAL [\old(len)=5, \result={-1:0}, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={-1:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={-1:0}, head->next={-2:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 VAL [head={-1:0}, head->data_0=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, len=5] [L591] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={-1:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 35 error locations. Result: UNSAFE, OverallTime: 17.0s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1035 SDtfs, 1364 SDslu, 5327 SDs, 0 SdLazy, 5081 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 495 SyntacticMatches, 18 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1171 ConstructedInterpolants, 7 QuantifiedInterpolants, 375464 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2446 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 988/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...