./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis 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/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c3fd3c6466616b2760d7784dc961566e83c949cf --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 11:12:14,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:12:14,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:12:14,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:12:14,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:12:14,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:12:14,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:12:14,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:12:14,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:12:14,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:12:14,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:12:14,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:12:14,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:12:14,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:12:14,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:12:14,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:12:14,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:12:14,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:12:14,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:12:14,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:12:14,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:12:14,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:12:14,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:12:14,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:12:14,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:12:14,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:12:14,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:12:14,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:12:14,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:12:14,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:12:14,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:12:14,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:12:14,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:12:14,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:12:14,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:12:14,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:12:14,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:12:14,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:12:14,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:12:14,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:12:14,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:12:14,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:12:14,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:12:14,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:12:14,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:12:14,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:12:14,083 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:12:14,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:12:14,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:12:14,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:12:14,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:12:14,085 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:12:14,085 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:12:14,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:12:14,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:12:14,086 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:12:14,086 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:12:14,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:12:14,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:12:14,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:12:14,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:12:14,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:12:14,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:12:14,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:12:14,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:12:14,089 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:12:14,089 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:12:14,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:12:14,090 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3fd3c6466616b2760d7784dc961566e83c949cf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:12:14,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:12:14,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:12:14,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:12:14,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:12:14,403 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:12:14,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-11-21 11:12:14,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc951cf9/e014310c84aa40758e6792137955da28/FLAGc483791ec [2019-11-21 11:12:14,959 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:12:14,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-11-21 11:12:14,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc951cf9/e014310c84aa40758e6792137955da28/FLAGc483791ec [2019-11-21 11:12:15,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc951cf9/e014310c84aa40758e6792137955da28 [2019-11-21 11:12:15,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:12:15,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:12:15,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:12:15,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:12:15,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:12:15,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:12:15" (1/1) ... [2019-11-21 11:12:15,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb698ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:15, skipping insertion in model container [2019-11-21 11:12:15,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:12:15" (1/1) ... [2019-11-21 11:12:15,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:12:15,347 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:12:15,761 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:12:15,761 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-21 11:12:15,762 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:12:15,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:12:15,814 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:12:15,827 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:12:15,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:12:15,908 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:12:15,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:12:16,017 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:12:16,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16 WrapperNode [2019-11-21 11:12:16,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:12:16,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:12:16,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:12:16,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:12:16,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (1/1) ... [2019-11-21 11:12:16,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:12:16,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:12:16,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:12:16,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:12:16,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (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-21 11:12:16,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:12:16,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:12:16,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:12:16,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:12:16,166 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 11:12:16,167 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 11:12:16,168 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 11:12:16,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:12:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 11:12:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:12:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:12:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:12:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:12:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:12:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:12:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:12:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:12:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:12:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:12:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:12:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:12:16,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:12:16,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:12:16,174 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:12:16,174 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:12:16,174 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:12:16,175 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:12:16,175 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:12:16,175 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:12:16,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:12:16,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:12:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:12:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:12:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:12:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:12:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:12:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:12:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:12:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:12:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:12:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:12:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:12:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:12:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:12:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:12:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:12:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:12:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:12:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:12:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:12:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:12:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:12:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:12:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:12:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:12:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:12:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:12:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:12:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:12:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:12:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:12:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:12:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:12:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:12:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:12:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 11:12:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:12:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:12:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:12:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:12:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:12:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:12:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:12:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:12:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:12:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:12:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:12:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:12:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:12:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:12:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:12:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:12:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:12:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:12:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:12:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:12:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:12:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:12:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:12:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:12:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:12:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:12:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:12:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:12:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:12:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:12:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:12:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:12:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:12:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:12:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:12:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:12:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:12:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:12:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:12:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 11:12:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:12:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:12:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:12:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:12:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 11:12:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:12:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 11:12:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:12:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:12:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:12:16,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:12:16,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:12:16,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:12:17,087 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:12:17,087 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 11:12:17,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:12:17 BoogieIcfgContainer [2019-11-21 11:12:17,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:12:17,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:12:17,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:12:17,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:12:17,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:12:15" (1/3) ... [2019-11-21 11:12:17,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b9c51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:12:17, skipping insertion in model container [2019-11-21 11:12:17,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:12:16" (2/3) ... [2019-11-21 11:12:17,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b9c51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:12:17, skipping insertion in model container [2019-11-21 11:12:17,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:12:17" (3/3) ... [2019-11-21 11:12:17,097 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2019-11-21 11:12:17,108 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:12:17,116 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 11:12:17,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 11:12:17,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:12:17,151 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:12:17,151 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:12:17,151 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:12:17,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:12:17,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:12:17,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:12:17,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:12:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 11:12:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:12:17,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:17,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:17,185 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 11:12:17,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:17,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1404480664] [2019-11-21 11:12:17,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:17,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 11:12:17,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:17,468 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-21 11:12:17,469 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:17,485 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-21 11:12:17,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404480664] [2019-11-21 11:12:17,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:17,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:12:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979831274] [2019-11-21 11:12:17,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 11:12:17,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 11:12:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 11:12:17,513 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 11:12:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:17,538 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 11:12:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 11:12:17,540 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 11:12:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:17,551 INFO L225 Difference]: With dead ends: 110 [2019-11-21 11:12:17,551 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 11:12:17,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 11:12:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 11:12:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 11:12:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 11:12:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 11:12:17,601 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 11:12:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:17,602 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 11:12:17,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 11:12:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 11:12:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:12:17,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:17,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:17,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:17,807 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 11:12:17,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:17,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1872370664] [2019-11-21 11:12:17,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:18,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:12:18,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:18,067 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-21 11:12:18,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:18,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:18,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:18,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:12:18,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:18,128 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 14 treesize of output 30 [2019-11-21 11:12:18,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:18,156 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 11:12:18,157 INFO L496 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-21 11:12:18,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 11:12:18,179 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-21 11:12:18,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:18,207 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-21 11:12:18,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872370664] [2019-11-21 11:12:18,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:18,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:12:18,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392257827] [2019-11-21 11:12:18,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:12:18,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:12:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:12:18,215 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 11:12:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:18,750 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 11:12:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:12:18,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 11:12:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:18,756 INFO L225 Difference]: With dead ends: 116 [2019-11-21 11:12:18,756 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 11:12:18,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:12:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 11:12:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 11:12:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 11:12:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 11:12:18,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 11:12:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:18,775 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 11:12:18,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:12:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 11:12:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:12:18,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:18,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:18,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:18,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 11:12:18,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:18,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1371849412] [2019-11-21 11:12:18,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:19,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 11:12:19,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:19,231 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-21 11:12:19,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:19,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:19,251 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-21 11:12:19,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:19,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:19,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:19,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:12:19,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:12:19,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-11-21 11:12:19,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:19,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:19,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:12:19,389 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:12:19,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:19,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:19,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:12:19,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-21 11:12:19,445 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-21 11:12:19,445 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:19,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:12:19,763 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-21 11:12:19,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371849412] [2019-11-21 11:12:19,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:19,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:12:19,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689642008] [2019-11-21 11:12:19,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:12:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:12:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:12:19,765 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 11:12:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:23,574 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 11:12:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:12:23,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:12:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:23,578 INFO L225 Difference]: With dead ends: 115 [2019-11-21 11:12:23,579 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 11:12:23,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-21 11:12:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 11:12:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 11:12:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 11:12:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 11:12:23,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 11:12:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:23,591 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 11:12:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:12:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 11:12:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:12:23,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:23,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:23,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:23,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 11:12:23,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:23,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1751697507] [2019-11-21 11:12:23,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:23,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:12:23,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:23,977 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-21 11:12:23,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:23,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:23,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:23,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:12:23,998 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-21 11:12:23,998 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:24,015 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-21 11:12:24,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751697507] [2019-11-21 11:12:24,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:24,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 11:12:24,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027386746] [2019-11-21 11:12:24,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:12:24,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:12:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:24,018 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 11:12:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:24,244 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 11:12:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:12:24,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:12:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:24,246 INFO L225 Difference]: With dead ends: 108 [2019-11-21 11:12:24,246 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 11:12:24,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 11:12:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 11:12:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 11:12:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 11:12:24,255 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 11:12:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:24,255 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 11:12:24,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:12:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 11:12:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:12:24,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:24,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:24,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:24,470 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 11:12:24,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:24,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1562397048] [2019-11-21 11:12:24,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:24,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:12:24,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:24,672 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-21 11:12:24,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:24,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:24,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:24,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:12:24,696 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-21 11:12:24,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:24,735 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-21 11:12:24,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562397048] [2019-11-21 11:12:24,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:24,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:12:24,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234552368] [2019-11-21 11:12:24,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:12:24,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:12:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:24,737 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 11:12:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:25,135 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 11:12:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:12:25,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:12:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:25,138 INFO L225 Difference]: With dead ends: 107 [2019-11-21 11:12:25,138 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 11:12:25,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 11:12:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 11:12:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 11:12:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 11:12:25,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 11:12:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:25,147 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 11:12:25,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:12:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 11:12:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 11:12:25,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:25,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:25,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:25,352 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 11:12:25,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:25,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [629483598] [2019-11-21 11:12:25,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:25,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:12:25,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:25,543 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-21 11:12:25,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:25,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:25,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:25,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:12:25,550 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-21 11:12:25,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:25,556 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-21 11:12:25,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629483598] [2019-11-21 11:12:25,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:25,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:12:25,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603566284] [2019-11-21 11:12:25,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 11:12:25,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 11:12:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:12:25,558 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 11:12:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:25,730 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 11:12:25,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:12:25,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 11:12:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:25,732 INFO L225 Difference]: With dead ends: 105 [2019-11-21 11:12:25,732 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 11:12:25,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:12:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 11:12:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 11:12:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 11:12:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 11:12:25,739 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 11:12:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:25,739 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 11:12:25,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 11:12:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 11:12:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 11:12:25,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:25,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:25,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:25,943 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 11:12:25,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:25,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024213885] [2019-11-21 11:12:25,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:26,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:12:26,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:26,151 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-21 11:12:26,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:26,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:26,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:26,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:12:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:12:26,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:26,214 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-21 11:12:26,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024213885] [2019-11-21 11:12:26,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:26,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:12:26,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404578664] [2019-11-21 11:12:26,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:12:26,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:12:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:26,216 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 11:12:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:26,627 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 11:12:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:12:26,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 11:12:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:26,630 INFO L225 Difference]: With dead ends: 106 [2019-11-21 11:12:26,630 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 11:12:26,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 11:12:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 11:12:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 11:12:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 11:12:26,636 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 11:12:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:26,636 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 11:12:26,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:12:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 11:12:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 11:12:26,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:26,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:26,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:26,840 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 11:12:26,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:26,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1094443900] [2019-11-21 11:12:26,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:27,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:12:27,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:27,035 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-21 11:12:27,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:27,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:27,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:27,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:12:27,059 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-21 11:12:27,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:27,111 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-21 11:12:27,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094443900] [2019-11-21 11:12:27,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:27,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 11:12:27,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184703465] [2019-11-21 11:12:27,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:12:27,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:12:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:12:27,115 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 11:12:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:27,661 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 11:12:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:12:27,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 11:12:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:27,664 INFO L225 Difference]: With dead ends: 135 [2019-11-21 11:12:27,664 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 11:12:27,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-21 11:12:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 11:12:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 11:12:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 11:12:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 11:12:27,670 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 11:12:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:27,671 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 11:12:27,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:12:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 11:12:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 11:12:27,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:27,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:27,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:27,879 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 11:12:27,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:27,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1133025147] [2019-11-21 11:12:27,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:28,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:12:28,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:28,077 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-21 11:12:28,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:28,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:28,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:28,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:12:28,103 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-21 11:12:28,103 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:28,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:12:28,180 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-21 11:12:28,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1133025147] [2019-11-21 11:12:28,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:28,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 11:12:28,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625037927] [2019-11-21 11:12:28,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:12:28,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:12:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:12:28,182 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 11:12:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:28,770 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 11:12:28,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:12:28,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 11:12:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:28,776 INFO L225 Difference]: With dead ends: 109 [2019-11-21 11:12:28,777 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 11:12:28,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:12:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 11:12:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 11:12:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 11:12:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 11:12:28,793 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 11:12:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:28,793 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 11:12:28,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:12:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 11:12:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:12:28,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:28,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:28,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:28,996 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 11:12:28,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:28,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1483779661] [2019-11-21 11:12:28,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:29,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:12:29,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:29,226 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-21 11:12:29,226 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:29,282 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-21 11:12:29,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483779661] [2019-11-21 11:12:29,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:29,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 11:12:29,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656832449] [2019-11-21 11:12:29,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:12:29,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:12:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:12:29,285 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 11:12:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:29,688 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 11:12:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:12:29,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 11:12:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:29,691 INFO L225 Difference]: With dead ends: 135 [2019-11-21 11:12:29,691 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 11:12:29,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:12:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 11:12:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 11:12:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 11:12:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 11:12:29,697 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 11:12:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:29,697 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 11:12:29,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:12:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 11:12:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:12:29,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:29,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:29,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:29,906 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 11:12:29,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:29,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [336042822] [2019-11-21 11:12:29,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:30,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 11:12:30,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:30,170 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-21 11:12:30,171 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:12:30,261 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-21 11:12:30,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336042822] [2019-11-21 11:12:30,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:30,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 11:12:30,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410871639] [2019-11-21 11:12:30,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 11:12:30,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 11:12:30,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 11:12:30,263 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 11:12:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:31,196 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 11:12:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:12:31,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 11:12:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:31,200 INFO L225 Difference]: With dead ends: 104 [2019-11-21 11:12:31,200 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 11:12:31,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:12:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 11:12:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 11:12:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 11:12:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 11:12:31,204 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 11:12:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:31,204 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 11:12:31,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 11:12:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 11:12:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:12:31,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:31,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:31,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:31,407 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 11:12:31,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:31,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [121771822] [2019-11-21 11:12:31,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:31,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 11:12:31,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:31,614 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-21 11:12:31,614 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:31,627 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-21 11:12:31,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121771822] [2019-11-21 11:12:31,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:31,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 11:12:31,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610806811] [2019-11-21 11:12:31,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:12:31,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:12:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:31,629 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 11:12:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:31,702 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 11:12:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:12:31,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 11:12:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:31,704 INFO L225 Difference]: With dead ends: 112 [2019-11-21 11:12:31,704 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 11:12:31,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:12:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 11:12:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 11:12:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 11:12:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 11:12:31,709 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 11:12:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:31,710 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 11:12:31,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:12:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 11:12:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 11:12:31,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:31,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:31,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:31,912 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 11:12:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:31,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1404691777] [2019-11-21 11:12:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:32,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:12:32,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:32,118 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-21 11:12:32,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:32,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:12:32,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:12:32,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:32,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 11:12:32,164 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 23 treesize of output 11 [2019-11-21 11:12:32,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:32,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:32,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 11:12:32,189 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-21 11:12:32,190 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:32,209 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-21 11:12:32,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404691777] [2019-11-21 11:12:32,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:32,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:12:32,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564195089] [2019-11-21 11:12:32,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:12:32,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:32,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:12:32,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:12:32,214 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 11:12:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:32,558 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-11-21 11:12:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:12:32,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 11:12:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:32,560 INFO L225 Difference]: With dead ends: 112 [2019-11-21 11:12:32,560 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 11:12:32,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 11:12:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 11:12:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-11-21 11:12:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 11:12:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 11:12:32,564 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 19 [2019-11-21 11:12:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:32,565 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 11:12:32,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:12:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 11:12:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 11:12:32,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:32,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:12:32,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:32,768 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:32,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 11:12:32,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:32,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [204358400] [2019-11-21 11:12:32,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:32,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 11:12:32,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:32,997 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-21 11:12:32,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:33,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:12:33,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:12:33,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:33,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:12:33,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:33,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-21 11:12:33,110 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 21 treesize of output 9 [2019-11-21 11:12:33,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:33,129 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 19 treesize of output 7 [2019-11-21 11:12:33,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:33,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:33,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-21 11:12:33,165 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-21 11:12:33,165 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:33,494 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-21 11:12:33,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [204358400] [2019-11-21 11:12:33,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:33,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:12:33,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544233839] [2019-11-21 11:12:33,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:12:33,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:12:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:12:33,496 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 10 states. [2019-11-21 11:12:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:12:35,422 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 11:12:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:12:35,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 11:12:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:12:35,424 INFO L225 Difference]: With dead ends: 116 [2019-11-21 11:12:35,424 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 11:12:35,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:12:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 11:12:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-11-21 11:12:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 11:12:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-21 11:12:35,429 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2019-11-21 11:12:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:12:35,429 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-21 11:12:35,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:12:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-21 11:12:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:12:35,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:12:35,430 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-21 11:12:35,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:35,633 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:12:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:12:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 11:12:35,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:12:35,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1897483864] [2019-11-21 11:12:35,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:12:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:12:35,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 11:12:35,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:12:35,910 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-21 11:12:35,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:35,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:35,921 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-21 11:12:35,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:35,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:35,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:12:35,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:12:35,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:12:35,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2019-11-21 11:12:35,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:35,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:36,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:12:36,009 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:12:36,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:12:36,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:12:36,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:12:36,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-21 11:12:36,044 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-21 11:12:36,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:12:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:12:36,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:12:36,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:39,707 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 11:12:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:12:42,392 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 11:12:42,551 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-21 11:12:42,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897483864] [2019-11-21 11:12:42,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:12:42,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:12:42,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37488110] [2019-11-21 11:12:42,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:12:42,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:12:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:12:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 11:12:42,554 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 10 states. [2019-11-21 11:12:51,108 WARN L192 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-21 11:12:57,556 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-21 11:13:01,745 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_4 (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-21 11:13:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:13:24,694 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2019-11-21 11:13:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:13:24,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 11:13:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:13:24,696 INFO L225 Difference]: With dead ends: 128 [2019-11-21 11:13:24,696 INFO L226 Difference]: Without dead ends: 128 [2019-11-21 11:13:24,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=4, NotChecked=24, Total=210 [2019-11-21 11:13:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-21 11:13:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2019-11-21 11:13:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 11:13:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-11-21 11:13:24,701 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 20 [2019-11-21 11:13:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:13:24,702 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-11-21 11:13:24,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:13:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-11-21 11:13:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:13:24,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:13:24,703 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] [2019-11-21 11:13:24,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:24,904 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:13:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:13:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 11:13:24,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:13:24,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1005900010] [2019-11-21 11:13:24,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:13:25,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:13:25,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:13:25,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 11:13:25,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:25,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:13:25,153 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-21 11:13:25,153 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:13:25,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:25,207 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 12 treesize of output 16 [2019-11-21 11:13:25,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:25,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:25,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 11:13:25,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2019-11-21 11:13:25,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:25,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:13:25,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 11:13:25,234 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-21 11:13:25,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1005900010] [2019-11-21 11:13:25,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:13:25,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:13:25,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295149256] [2019-11-21 11:13:25,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:13:25,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:13:25,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:13:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:13:25,236 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2019-11-21 11:13:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:13:25,507 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 11:13:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:13:25,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 11:13:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:13:25,509 INFO L225 Difference]: With dead ends: 113 [2019-11-21 11:13:25,509 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 11:13:25,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:13:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 11:13:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-11-21 11:13:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 11:13:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-21 11:13:25,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 22 [2019-11-21 11:13:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:13:25,515 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-21 11:13:25,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:13:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-21 11:13:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:13:25,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:13:25,516 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] [2019-11-21 11:13:25,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:25,723 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:13:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:13:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 11:13:25,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:13:25,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [805428550] [2019-11-21 11:13:25,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:13:25,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:13:25,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:13:25,996 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-21 11:13:25,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:13:26,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:13:26,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-21 11:13:26,124 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:26,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-21 11:13:26,135 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:26,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:26,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 11:13:26,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 11:13:26,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:26,304 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 16 treesize of output 20 [2019-11-21 11:13:26,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:26,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:26,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:26,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 11:13:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:27,120 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-21 11:13:27,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [805428550] [2019-11-21 11:13:27,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:13:27,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:13:27,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875647446] [2019-11-21 11:13:27,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:13:27,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:13:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:13:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:13:27,122 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-21 11:13:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:13:27,773 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-21 11:13:27,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:13:27,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 11:13:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:13:27,775 INFO L225 Difference]: With dead ends: 107 [2019-11-21 11:13:27,776 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 11:13:27,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:13:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 11:13:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 11:13:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 11:13:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 11:13:27,781 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-21 11:13:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:13:27,781 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 11:13:27,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:13:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 11:13:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:13:27,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:13:27,782 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] [2019-11-21 11:13:27,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:27,985 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:13:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:13:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 11:13:27,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:13:27,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1692370805] [2019-11-21 11:13:27,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:13:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:13:28,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 11:13:28,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:13:28,258 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-21 11:13:28,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,271 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-21 11:13:28,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:13:28,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,323 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 13 treesize of output 17 [2019-11-21 11:13:28,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2019-11-21 11:13:28,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,359 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 11:13:28,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:28,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 11:13:28,495 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 11:13:28,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,507 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-21 11:13:28,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:28,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-21 11:13:28,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:28,600 INFO L567 ElimStorePlain]: treesize reduction 18, result has 58.1 percent of original size [2019-11-21 11:13:28,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:13:28,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:25 [2019-11-21 11:13:28,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,702 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-21 11:13:28,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:13:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:13:28,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:13:28,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:13:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:28,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:33,803 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 11:13:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:13:34,507 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 11:13:34,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:13:34,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:34,705 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 13 treesize of output 17 [2019-11-21 11:13:34,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:13:34,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:13:34,733 INFO L496 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-21 11:13:34,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 11:13:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:13:35,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1692370805] [2019-11-21 11:13:35,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:13:35,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 11:13:35,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155318619] [2019-11-21 11:13:35,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 11:13:35,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:13:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 11:13:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-11-21 11:13:35,069 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 16 states. [2019-11-21 11:13:43,200 WARN L192 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-21 11:13:49,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10))))) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-21 11:14:05,222 WARN L192 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-21 11:14:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:14:18,787 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-21 11:14:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 11:14:18,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-21 11:14:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:14:18,790 INFO L225 Difference]: With dead ends: 129 [2019-11-21 11:14:18,790 INFO L226 Difference]: Without dead ends: 129 [2019-11-21 11:14:18,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=4, NotChecked=36, Total=420 [2019-11-21 11:14:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-21 11:14:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2019-11-21 11:14:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 11:14:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-21 11:14:18,797 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 22 [2019-11-21 11:14:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:14:18,797 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-21 11:14:18,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 11:14:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-21 11:14:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 11:14:18,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:14:18,798 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:14:18,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:14:18,999 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 11:14:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:14:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 11:14:19,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:14:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1005104382] [2019-11-21 11:14:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:14:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:14:19,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 11:14:19,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:14:19,250 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-21 11:14:19,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,262 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-21 11:14:19,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:14:19,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,362 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-21 11:14:19,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-11-21 11:14:19,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,404 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 11:14:19,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:14:19,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 11:14:19,460 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 11:14:19,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,473 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 13 treesize of output 17 [2019-11-21 11:14:19,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:19,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-21 11:14:19,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:19,553 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 11:14:19,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:14:19,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 11:14:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:14:19,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:14:19,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:14:20,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:14:20,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:20,094 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 24 treesize of output 28 [2019-11-21 11:14:20,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:20,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:20,124 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 32 treesize of output 36 [2019-11-21 11:14:20,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:20,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:20,142 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 22 treesize of output 26 [2019-11-21 11:14:20,142 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:14:20,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:14:20,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 11:14:20,204 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 11:14:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:14:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:14:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:20,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 11:14:20,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 11:14:21,835 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 11:14:21,840 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:14:21,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:14:21,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:14:21,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:14:21,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:14:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:14:21,892 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-21 11:14:21,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-21 11:14:21,943 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 11:14:22,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:14:22,145 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 11:14:22,150 INFO L168 Benchmark]: Toolchain (without parser) took 126871.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -99.7 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-11-21 11:14:22,150 INFO L168 Benchmark]: CDTParser took 0.62 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-21 11:14:22,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-21 11:14:22,150 INFO L168 Benchmark]: Boogie Preprocessor took 72.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 11:14:22,151 INFO L168 Benchmark]: RCFGBuilder took 998.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-11-21 11:14:22,151 INFO L168 Benchmark]: TraceAbstraction took 125058.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2019-11-21 11:14:22,152 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.62 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 737.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 998.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125058.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...