./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 32bit -------------------------------------------------------------------------------- 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-32bit-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 32bit --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 12:33:01,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:33:01,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:33:01,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:33:01,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:33:01,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:33:01,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:33:01,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:33:01,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:33:01,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:33:01,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:33:01,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:33:01,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:33:01,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:33:01,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:33:01,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:33:01,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:33:01,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:33:01,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:33:02,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:33:02,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:33:02,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:33:02,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:33:02,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:33:02,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:33:02,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:33:02,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:33:02,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:33:02,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:33:02,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:33:02,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:33:02,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:33:02,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:33:02,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:33:02,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:33:02,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:33:02,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:33:02,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:33:02,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:33:02,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:33:02,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:33:02,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:33:02,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:33:02,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:33:02,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:33:02,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:33:02,047 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:33:02,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:33:02,048 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:33:02,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:33:02,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:33:02,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:33:02,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:33:02,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:33:02,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:33:02,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:33:02,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:33:02,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:33:02,050 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:33:02,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:33:02,050 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:33:02,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:33:02,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:33:02,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:33:02,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:33:02,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:33:02,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:33:02,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:33:02,052 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:33:02,052 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:33:02,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:33:02,052 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 -> 32bit 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 12:33:02,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:33:02,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:33:02,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:33:02,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:33:02,381 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:33:02,382 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 12:33:02,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aac401/7dbd686c55074f12a10c78f7ca3d709c/FLAG59e13dcf5 [2019-11-21 12:33:02,969 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:33:02,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-11-21 12:33:02,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aac401/7dbd686c55074f12a10c78f7ca3d709c/FLAG59e13dcf5 [2019-11-21 12:33:03,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aac401/7dbd686c55074f12a10c78f7ca3d709c [2019-11-21 12:33:03,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:33:03,271 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:33:03,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:33:03,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:33:03,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:33:03,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d7d8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03, skipping insertion in model container [2019-11-21 12:33:03,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:33:03,327 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:33:03,691 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 12:33:03,692 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-21 12:33:03,692 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:33:03,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:33:03,721 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:33:03,729 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:33:03,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:33:03,795 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:33:03,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:33:03,904 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:33:03,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03 WrapperNode [2019-11-21 12:33:03,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:33:03,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:33:03,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:33:03,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:33:03,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (1/1) ... [2019-11-21 12:33:03,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:33:03,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:33:03,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:33:03,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:33:03,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (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 12:33:04,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:33:04,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:33:04,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:33:04,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:33:04,037 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 12:33:04,037 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 12:33:04,037 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 12:33:04,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:33:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 12:33:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:33:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:33:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:33:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:33:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:33:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:33:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:33:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:33:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:33:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:33:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:33:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:33:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:33:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:33:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:33:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:33:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:33:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:33:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:33:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:33:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:33:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:33:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:33:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:33:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:33:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:33:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:33:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:33:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:33:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:33:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:33:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:33:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:33:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:33:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:33:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:33:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:33:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:33:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:33:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:33:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 12:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:33:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:33:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:33:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:33:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:33:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:33:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:33:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:33:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:33:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:33:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:33:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:33:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:33:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:33:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:33:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:33:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 12:33:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:33:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:33:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:33:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:33:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 12:33:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:33:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 12:33:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:33:04,927 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:33:04,928 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 12:33:04,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:33:04 BoogieIcfgContainer [2019-11-21 12:33:04,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:33:04,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:33:04,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:33:04,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:33:04,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:33:03" (1/3) ... [2019-11-21 12:33:04,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e6770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:33:04, skipping insertion in model container [2019-11-21 12:33:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:33:03" (2/3) ... [2019-11-21 12:33:04,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e6770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:33:04, skipping insertion in model container [2019-11-21 12:33:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:33:04" (3/3) ... [2019-11-21 12:33:04,937 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2019-11-21 12:33:04,949 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:33:04,957 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 12:33:04,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 12:33:04,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:33:04,995 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:33:04,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:33:04,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:33:04,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:33:04,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:33:04,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:33:04,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:33:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 12:33:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:33:05,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:05,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:05,041 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 12:33:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 12:33:05,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:05,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [839200646] [2019-11-21 12:33:05,061 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 12:33:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:05,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 12:33:05,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:05,310 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 12:33:05,310 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:05,329 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 12:33:05,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [839200646] [2019-11-21 12:33:05,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:05,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:33:05,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487842625] [2019-11-21 12:33:05,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 12:33:05,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 12:33:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 12:33:05,355 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 12:33:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:05,379 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 12:33:05,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 12:33:05,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 12:33:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:05,392 INFO L225 Difference]: With dead ends: 110 [2019-11-21 12:33:05,393 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:33:05,395 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 12:33:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:33:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:33:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:33:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 12:33:05,443 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 12:33:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:05,444 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 12:33:05,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 12:33:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 12:33:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:33:05,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:05,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:05,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:05,648 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 12:33:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 12:33:05,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:05,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [442219489] [2019-11-21 12:33:05,651 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 12:33:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:05,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:33:05,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:05,917 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 12:33:05,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:05,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:05,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:05,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:33:05,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:05,972 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 12:33:05,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:05,998 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 12:33:05,999 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 12:33:06,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 12:33:06,017 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 12:33:06,018 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:06,041 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 12:33:06,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [442219489] [2019-11-21 12:33:06,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:06,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:33:06,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506328663] [2019-11-21 12:33:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:33:06,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:33:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:33:06,046 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 12:33:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:06,583 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 12:33:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:33:06,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 12:33:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:06,591 INFO L225 Difference]: With dead ends: 116 [2019-11-21 12:33:06,593 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 12:33:06,594 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 12:33:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 12:33:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 12:33:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:33:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 12:33:06,628 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 12:33:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:06,630 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 12:33:06,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:33:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 12:33:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:33:06,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:06,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:06,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:06,834 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 12:33:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 12:33:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:06,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2008057005] [2019-11-21 12:33:06,836 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 12:33:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:07,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 12:33:07,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:07,084 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 12:33:07,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:07,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:07,098 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 12:33:07,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:07,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:07,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:07,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:33:07,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:33:07,189 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 12:33:07,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:07,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:07,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:33:07,215 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 12:33:07,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:07,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:07,230 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 12:33:07,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 12:33:07,256 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 12:33:07,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:07,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:07,608 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 12:33:07,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008057005] [2019-11-21 12:33:07,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:07,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 12:33:07,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159937742] [2019-11-21 12:33:07,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:33:07,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:33:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:33:07,610 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 12:33:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:11,425 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 12:33:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:33:11,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 12:33:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:11,428 INFO L225 Difference]: With dead ends: 115 [2019-11-21 12:33:11,428 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 12:33:11,429 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 12:33:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 12:33:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 12:33:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:33:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 12:33:11,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 12:33:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:11,439 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 12:33:11,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:33:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 12:33:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 12:33:11,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:11,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:11,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:11,644 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 12:33:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 12:33:11,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:11,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1885876836] [2019-11-21 12:33:11,647 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 12:33:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:11,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:33:11,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:11,815 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 12:33:11,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:11,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:11,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:11,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:33:11,832 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 12:33:11,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:11,858 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 12:33:11,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885876836] [2019-11-21 12:33:11,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:11,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 12:33:11,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788726457] [2019-11-21 12:33:11,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:33:11,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:33:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:33:11,864 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 12:33:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:12,065 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 12:33:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:33:12,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 12:33:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:12,067 INFO L225 Difference]: With dead ends: 108 [2019-11-21 12:33:12,067 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 12:33:12,068 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 12:33:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 12:33:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 12:33:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:33:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 12:33:12,076 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 12:33:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:12,076 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 12:33:12,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:33:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 12:33:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 12:33:12,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:12,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:12,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:12,283 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 12:33:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 12:33:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1954616325] [2019-11-21 12:33:12,286 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 12:33:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:12,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:33:12,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:12,502 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 12:33:12,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:12,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:12,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:12,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:33:12,523 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 12:33:12,523 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:12,561 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 12:33:12,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954616325] [2019-11-21 12:33:12,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:12,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:33:12,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817558465] [2019-11-21 12:33:12,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:33:12,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:33:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:33:12,563 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 12:33:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:12,979 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 12:33:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:33:12,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 12:33:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:12,982 INFO L225 Difference]: With dead ends: 107 [2019-11-21 12:33:12,982 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:33:12,982 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 12:33:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:33:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:33:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:33:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 12:33:12,992 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 12:33:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:12,993 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 12:33:12,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:33:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 12:33:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 12:33:12,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:12,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:13,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:13,206 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 12:33:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 12:33:13,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:13,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [555518728] [2019-11-21 12:33:13,209 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 12:33:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:13,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:33:13,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:13,387 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 12:33:13,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:13,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:13,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:13,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:33:13,399 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 12:33:13,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:13,406 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 12:33:13,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [555518728] [2019-11-21 12:33:13,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:13,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:33:13,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173228505] [2019-11-21 12:33:13,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:33:13,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:33:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:33:13,408 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 12:33:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:13,576 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 12:33:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:33:13,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 12:33:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:13,577 INFO L225 Difference]: With dead ends: 105 [2019-11-21 12:33:13,577 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 12:33:13,577 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 12:33:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 12:33:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 12:33:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 12:33:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 12:33:13,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 12:33:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:13,585 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 12:33:13,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:33:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 12:33:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 12:33:13,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:13,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:13,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:13,799 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 12:33:13,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 12:33:13,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:13,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [200649314] [2019-11-21 12:33:13,801 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 12:33:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:14,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:33:14,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:14,010 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 12:33:14,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:14,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:14,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:14,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:33:14,025 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 12:33:14,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:14,064 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 12:33:14,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200649314] [2019-11-21 12:33:14,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:14,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:33:14,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243739780] [2019-11-21 12:33:14,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:33:14,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:14,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:33:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:33:14,066 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 12:33:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:14,449 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 12:33:14,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:33:14,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 12:33:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:14,451 INFO L225 Difference]: With dead ends: 106 [2019-11-21 12:33:14,452 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 12:33:14,452 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 12:33:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 12:33:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 12:33:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 12:33:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 12:33:14,458 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 12:33:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:14,459 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 12:33:14,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:33:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 12:33:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:33:14,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:14,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:14,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:14,668 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 12:33:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 12:33:14,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:14,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1170600984] [2019-11-21 12:33:14,670 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 12:33:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:14,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:33:14,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:14,873 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 12:33:14,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:14,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:14,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:14,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:33:14,896 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 12:33:14,896 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:14,952 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 12:33:14,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170600984] [2019-11-21 12:33:14,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:14,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 12:33:14,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931061927] [2019-11-21 12:33:14,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:33:14,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:33:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:33:14,953 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 12:33:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:15,460 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 12:33:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:33:15,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 12:33:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:15,461 INFO L225 Difference]: With dead ends: 135 [2019-11-21 12:33:15,461 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:33:15,462 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 12:33:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:33:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 12:33:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 12:33:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 12:33:15,468 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 12:33:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:15,469 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 12:33:15,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:33:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 12:33:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:33:15,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:15,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:33:15,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:15,673 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 12:33:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 12:33:15,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:15,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1422869717] [2019-11-21 12:33:15,675 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 12:33:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:15,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:33:15,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:15,873 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 12:33:15,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:15,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:15,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:15,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:33:15,912 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 12:33:15,912 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:16,026 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 12:33:16,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1422869717] [2019-11-21 12:33:16,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:16,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 12:33:16,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994468105] [2019-11-21 12:33:16,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:33:16,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:33:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:33:16,028 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 12:33:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:16,612 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 12:33:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:33:16,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 12:33:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:16,616 INFO L225 Difference]: With dead ends: 109 [2019-11-21 12:33:16,616 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 12:33:16,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:33:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 12:33:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 12:33:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 12:33:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 12:33:16,622 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 12:33:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:16,623 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 12:33:16,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:33:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 12:33:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:33:16,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:16,624 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 12:33:16,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:16,835 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 12:33:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 12:33:16,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:16,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [888723170] [2019-11-21 12:33:16,836 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 12:33:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:17,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:33:17,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:17,063 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 12:33:17,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:17,113 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 12:33:17,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [888723170] [2019-11-21 12:33:17,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:17,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:33:17,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223460135] [2019-11-21 12:33:17,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:33:17,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:33:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:33:17,115 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 12:33:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:17,512 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 12:33:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:33:17,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 12:33:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:17,514 INFO L225 Difference]: With dead ends: 135 [2019-11-21 12:33:17,515 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:33:17,515 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 12:33:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:33:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 12:33:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 12:33:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 12:33:17,520 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 12:33:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:17,520 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 12:33:17,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:33:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 12:33:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:33:17,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:17,521 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 12:33:17,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:17,724 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 12:33:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 12:33:17,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:17,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1144290782] [2019-11-21 12:33:17,726 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 12:33:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:17,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:33:17,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:33:17,988 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:18,079 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 12:33:18,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1144290782] [2019-11-21 12:33:18,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:18,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 12:33:18,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460254606] [2019-11-21 12:33:18,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 12:33:18,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 12:33:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:33:18,081 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 12:33:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:18,961 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 12:33:18,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:33:18,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 12:33:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:18,963 INFO L225 Difference]: With dead ends: 104 [2019-11-21 12:33:18,963 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 12:33:18,964 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 12:33:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 12:33:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 12:33:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 12:33:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 12:33:18,967 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 12:33:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:18,967 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 12:33:18,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 12:33:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 12:33:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:33:18,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:18,968 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 12:33:19,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:19,169 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 12:33:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 12:33:19,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:19,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2095925619] [2019-11-21 12:33:19,171 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 12:33:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:19,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 12:33:19,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:19,374 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 12:33:19,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:19,388 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 12:33:19,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095925619] [2019-11-21 12:33:19,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:19,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:33:19,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675830728] [2019-11-21 12:33:19,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:33:19,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:33:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:33:19,390 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 12:33:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:19,446 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 12:33:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:33:19,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 12:33:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:19,455 INFO L225 Difference]: With dead ends: 112 [2019-11-21 12:33:19,455 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 12:33:19,455 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 12:33:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 12:33:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 12:33:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 12:33:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 12:33:19,459 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 12:33:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:19,459 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 12:33:19,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:33:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 12:33:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:33:19,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:19,460 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 12:33:19,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:19,663 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 12:33:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 12:33:19,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:19,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [548646895] [2019-11-21 12:33:19,664 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 12:33:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:19,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:33:19,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:19,887 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 12:33:19,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:19,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:19,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:19,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:33:19,900 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 12:33:19,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:19,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:19,914 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 12:33:19,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 12:33:19,937 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 12:33:19,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:19,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:19,943 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 12:33:19,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 12:33:19,955 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 12:33:19,956 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:19,971 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 12:33:19,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [548646895] [2019-11-21 12:33:19,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:19,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:33:19,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754607854] [2019-11-21 12:33:19,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:33:19,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:33:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:33:19,973 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 12:33:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:20,332 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-11-21 12:33:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:33:20,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 12:33:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:20,334 INFO L225 Difference]: With dead ends: 112 [2019-11-21 12:33:20,334 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 12:33:20,335 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 12:33:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 12:33:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-11-21 12:33:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:33:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 12:33:20,341 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 19 [2019-11-21 12:33:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:20,341 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 12:33:20,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:33:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 12:33:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:33:20,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:20,342 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 12:33:20,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:20,547 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 12:33:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 12:33:20,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:20,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1053752643] [2019-11-21 12:33:20,549 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 12:33:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:20,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 12:33:20,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:20,775 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 12:33:20,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:20,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:33:20,812 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 12:33:20,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:20,836 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 12:33:20,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:20,852 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 12:33:20,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 12:33:20,903 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 12:33:20,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:20,926 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 12:33:20,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:20,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:20,936 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 12:33:20,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 12:33:20,959 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 12:33:20,959 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:21,266 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 12:33:21,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1053752643] [2019-11-21 12:33:21,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:21,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:33:21,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27367503] [2019-11-21 12:33:21,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:33:21,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:33:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:33:21,268 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 10 states. [2019-11-21 12:33:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:33:23,176 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 12:33:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:33:23,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 12:33:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:33:23,178 INFO L225 Difference]: With dead ends: 116 [2019-11-21 12:33:23,178 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 12:33:23,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:33:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 12:33:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-11-21 12:33:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 12:33:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-21 12:33:23,183 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2019-11-21 12:33:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:33:23,183 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-21 12:33:23,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:33:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-21 12:33:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:33:23,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:33:23,184 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 12:33:23,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:33:23,388 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 12:33:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:33:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 12:33:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:33:23,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1687855807] [2019-11-21 12:33:23,390 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 12:33:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:33:23,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 12:33:23,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:33:23,639 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 12:33:23,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:23,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:23,650 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 12:33:23,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:23,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:23,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:33:23,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:33:23,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:33:23,745 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 12:33:23,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:23,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:23,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:23,772 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 12:33:23,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:33:23,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:33:23,783 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 12:33:23,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-21 12:33:23,806 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 12:33:23,806 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:33:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:33:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:29,035 WARN L192 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:33:29,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:33:31,481 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 12:33:31,620 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 12:33:31,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1687855807] [2019-11-21 12:33:31,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:33:31,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:33:31,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195122854] [2019-11-21 12:33:31,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:33:31,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:33:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:33:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 12:33:31,623 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 10 states. [2019-11-21 12:33:37,814 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (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 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-21 12:33:41,965 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (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 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|))))))) is different from false [2019-11-21 12:34:01,751 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-11-21 12:34:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:34:07,430 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-21 12:34:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:34:07,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 12:34:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:34:07,431 INFO L225 Difference]: With dead ends: 130 [2019-11-21 12:34:07,431 INFO L226 Difference]: Without dead ends: 130 [2019-11-21 12:34:07,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=3, NotChecked=42, Total=182 [2019-11-21 12:34:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-21 12:34:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2019-11-21 12:34:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 12:34:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-11-21 12:34:07,437 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 20 [2019-11-21 12:34:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:34:07,437 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-11-21 12:34:07,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:34:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-11-21 12:34:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:34:07,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:34:07,440 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 12:34:07,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:34:07,641 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 12:34:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:34:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 12:34:07,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:34:07,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1810561212] [2019-11-21 12:34:07,643 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 12:34:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:34:07,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:34:07,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:34:07,859 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 12:34:07,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:07,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:34:07,875 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 12:34:07,875 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:34:07,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:07,927 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 12:34:07,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:07,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:07,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 12:34:07,949 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 12:34:07,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:07,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:34:07,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 12:34:07,962 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 12:34:07,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1810561212] [2019-11-21 12:34:07,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:34:07,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:34:07,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880735137] [2019-11-21 12:34:07,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:34:07,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:34:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:34:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:34:07,964 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2019-11-21 12:34:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:34:08,260 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 12:34:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:34:08,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 12:34:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:34:08,262 INFO L225 Difference]: With dead ends: 113 [2019-11-21 12:34:08,263 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 12:34:08,263 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 12:34:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 12:34:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-11-21 12:34:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 12:34:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-21 12:34:08,267 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 22 [2019-11-21 12:34:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:34:08,267 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-21 12:34:08,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:34:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-21 12:34:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:34:08,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:34:08,268 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 12:34:08,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:34:08,471 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 12:34:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:34:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 12:34:08,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:34:08,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [440736997] [2019-11-21 12:34:08,473 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 12:34:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:34:08,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:34:08,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:34:08,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 12:34:08,736 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:34:08,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:08,862 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 12:34:08,863 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 12:34:08,868 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 12:34:08,869 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 12:34:08,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:08,908 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 12:34:08,909 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 12:34:09,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:09,042 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 12:34:09,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,044 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 12:34:09,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:09,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,083 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 12:34:09,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 12:34:09,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:09,931 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 12:34:09,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440736997] [2019-11-21 12:34:09,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:34:09,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:34:09,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350415475] [2019-11-21 12:34:09,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:34:09,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:34:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:34:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:34:09,933 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-21 12:34:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:34:10,610 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-21 12:34:10,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:34:10,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 12:34:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:34:10,612 INFO L225 Difference]: With dead ends: 107 [2019-11-21 12:34:10,612 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:34:10,612 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 12:34:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:34:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:34:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:34:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 12:34:10,620 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-21 12:34:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:34:10,620 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 12:34:10,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:34:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 12:34:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:34:10,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:34:10,623 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 12:34:10,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:34:10,827 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 12:34:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:34:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 12:34:10,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:34:10,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1689121645] [2019-11-21 12:34:10,829 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 12:34:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:34:11,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 12:34:11,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:34:11,098 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 12:34:11,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,114 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 12:34:11,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:34:11,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,194 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 12:34:11,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,211 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 12:34:11,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,229 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 12:34:11,229 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 12:34:11,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 12:34:11,341 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 12:34:11,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,357 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 12:34:11,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:11,403 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 12:34:11,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:11,440 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-21 12:34:11,441 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 12:34:11,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-21 12:34:11,454 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 12:34:11,454 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:34:11,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:11,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:11,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:14,445 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:34:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:34:16,961 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 12:34:17,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:34:17,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:17,105 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 12:34:17,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:34:17,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:34:17,125 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 12:34:17,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 12:34:17,477 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 12:34:17,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1689121645] [2019-11-21 12:34:17,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:34:17,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-21 12:34:17,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333069134] [2019-11-21 12:34:17,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:34:17,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:34:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:34:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:34:17,480 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2019-11-21 12:34:23,713 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (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 (_ bv4 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| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (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 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)))))))) (= (bvadd (select |c_#length| c_append_~pointerToList.base) (_ bv4294967292 32)) (_ bv0 32)) (exists ((|append_#t~malloc12.base| (_ BitVec 32))) (= (_ bv8 32) (select |c_#length| |append_#t~malloc12.base|))) (= (_ bv0 32) c_append_~pointerToList.offset) (= (bvadd (select |c_#valid| |c_append_#in~pointerToList.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv4 32) (select |c_#length| |c_append_#in~pointerToList.base|)) (= (_ bv0 32) |c_append_#in~pointerToList.offset|) (= (_ bv1 1) (select |c_#valid| c_append_~pointerToList.base))) is different from false [2019-11-21 12:34:46,351 WARN L192 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-21 12:35:20,368 WARN L192 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-21 12:35:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:48,412 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2019-11-21 12:35:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 12:35:48,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-21 12:35:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:48,414 INFO L225 Difference]: With dead ends: 127 [2019-11-21 12:35:48,415 INFO L226 Difference]: Without dead ends: 127 [2019-11-21 12:35:48,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=64, Invalid=272, Unknown=10, NotChecked=34, Total=380 [2019-11-21 12:35:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-21 12:35:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-21 12:35:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 12:35:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-21 12:35:48,421 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 22 [2019-11-21 12:35:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:48,421 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-21 12:35:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:35:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-21 12:35:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:35:48,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:48,422 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 12:35:48,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:48,623 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 12:35:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 12:35:48,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:48,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2120778276] [2019-11-21 12:35:48,625 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 12:35:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:48,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 12:35:48,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:48,881 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 12:35:48,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:48,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:48,894 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 12:35:48,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:48,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:48,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:48,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:35:49,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,002 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 12:35:49,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,020 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 12:35:49,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,044 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 12:35:49,045 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 12:35:49,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 12:35:49,104 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 12:35:49,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,116 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 12:35:49,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,163 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 12:35:49,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,200 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 12:35:49,201 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 12:35:49,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 12:35:49,248 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 12:35:49,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:49,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:49,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,789 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 12:35:49,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,817 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 12:35:49,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,832 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 12:35:49,833 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:49,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:49,887 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 12:35:49,887 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 12:35:50,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:50,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:50,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:50,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:50,045 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 12:35:50,054 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 12:35:51,972 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 12:35:51,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:35:51,988 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:35:51,996 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:35:52,000 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:35:52,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 12:35:52,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:52,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:52,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:52,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-21 12:35:52,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 12:35:52,166 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 12:35:52,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:52,370 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 12:35:52,376 INFO L168 Benchmark]: Toolchain (without parser) took 169105.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:35:52,376 INFO L168 Benchmark]: CDTParser took 0.30 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 12:35:52,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:35:52,377 INFO L168 Benchmark]: Boogie Preprocessor took 72.09 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 12:35:52,377 INFO L168 Benchmark]: RCFGBuilder took 951.11 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.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:35:52,378 INFO L168 Benchmark]: TraceAbstraction took 167443.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-21 12:35:52,380 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.30 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 633.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.09 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 951.11 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.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 167443.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.2 MB). Peak memory consumption was 58.2 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...