./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa 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-1.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 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-6b5699a [2019-11-21 21:56:32,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 21:56:32,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 21:56:32,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 21:56:32,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 21:56:32,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 21:56:32,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 21:56:32,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 21:56:32,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 21:56:32,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 21:56:32,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 21:56:32,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 21:56:32,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 21:56:32,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 21:56:32,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 21:56:32,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 21:56:32,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 21:56:32,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 21:56:32,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 21:56:32,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 21:56:32,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 21:56:32,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 21:56:32,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 21:56:32,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 21:56:32,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 21:56:32,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 21:56:32,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 21:56:32,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 21:56:32,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 21:56:32,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 21:56:32,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 21:56:32,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 21:56:32,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 21:56:32,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 21:56:32,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 21:56:32,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 21:56:32,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 21:56:32,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 21:56:32,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 21:56:32,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 21:56:32,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 21:56:32,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 21:56:32,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 21:56:32,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 21:56:32,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 21:56:32,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 21:56:32,889 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 21:56:32,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 21:56:32,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 21:56:32,892 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 21:56:32,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 21:56:32,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 21:56:32,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 21:56:32,893 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 21:56:32,893 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 21:56:32,894 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 21:56:32,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 21:56:32,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-21 21:56:32,896 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 21:56:32,897 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 21:56:32,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 21:56:32,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 21:56:32,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 21:56:32,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 21:56:32,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 21:56:32,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 21:56:32,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 21:56:32,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 21:56:32,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 21:56:32,900 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 21:56:32,901 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 21:56:32,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 21:56:32,901 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 -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-21 21:56:33,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 21:56:33,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 21:56:33,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 21:56:33,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 21:56:33,254 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 21:56:33,256 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-1.i [2019-11-21 21:56:33,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babb73462/b7ac1f8b90a749d2bfa393a60df5b623/FLAGa8bb83d6a [2019-11-21 21:56:33,843 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 21:56:33,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 21:56:33,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babb73462/b7ac1f8b90a749d2bfa393a60df5b623/FLAGa8bb83d6a [2019-11-21 21:56:34,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babb73462/b7ac1f8b90a749d2bfa393a60df5b623 [2019-11-21 21:56:34,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 21:56:34,211 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 21:56:34,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 21:56:34,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 21:56:34,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 21:56:34,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34, skipping insertion in model container [2019-11-21 21:56:34,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 21:56:34,286 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 21:56:34,664 INFO L965 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 21:56:34,664 INFO L968 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-21 21:56:34,664 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 21:56:34,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:56:34,696 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 21:56:34,703 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 21:56:34,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:56:34,787 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 21:56:34,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:56:34,894 INFO L205 MainTranslator]: Completed translation [2019-11-21 21:56:34,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34 WrapperNode [2019-11-21 21:56:34,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 21:56:34,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 21:56:34,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 21:56:34,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 21:56:34,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (1/1) ... [2019-11-21 21:56:34,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 21:56:34,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 21:56:34,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 21:56:34,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 21:56:34,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (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 21:56:35,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 21:56:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 21:56:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-21 21:56:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 21:56:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 21:56:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 21:56:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 21:56:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 21:56:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 21:56:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 21:56:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 21:56:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 21:56:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 21:56:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 21:56:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 21:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 21:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 21:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 21:56:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 21:56:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 21:56:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 21:56:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 21:56:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 21:56:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 21:56:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 21:56:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 21:56:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 21:56:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 21:56:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 21:56:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 21:56:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 21:56:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 21:56:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 21:56:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 21:56:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 21:56:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 21:56:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 21:56:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 21:56:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 21:56:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 21:56:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 21:56:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 21:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 21:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 21:56:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 21:56:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 21:56:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 21:56:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 21:56:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 21:56:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-21 21:56:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 21:56:36,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 21:56:36,010 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 21:56:36,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:56:36 BoogieIcfgContainer [2019-11-21 21:56:36,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 21:56:36,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 21:56:36,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 21:56:36,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 21:56:36,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:56:34" (1/3) ... [2019-11-21 21:56:36,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abe29f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:56:36, skipping insertion in model container [2019-11-21 21:56:36,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:56:34" (2/3) ... [2019-11-21 21:56:36,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abe29f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:56:36, skipping insertion in model container [2019-11-21 21:56:36,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:56:36" (3/3) ... [2019-11-21 21:56:36,027 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-21 21:56:36,038 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 21:56:36,048 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 21:56:36,060 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 21:56:36,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 21:56:36,083 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 21:56:36,083 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 21:56:36,083 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 21:56:36,084 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 21:56:36,084 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 21:56:36,084 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 21:56:36,084 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 21:56:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 21:56:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 21:56:36,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:36,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:36,121 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 21:56:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-21 21:56:36,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:36,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [52008220] [2019-11-21 21:56:36,138 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 21:56:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:36,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 21:56:36,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:36,377 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 21:56:36,377 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:36,396 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 21:56:36,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [52008220] [2019-11-21 21:56:36,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:36,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 21:56:36,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493142649] [2019-11-21 21:56:36,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 21:56:36,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 21:56:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 21:56:36,425 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 21:56:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:36,454 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 21:56:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 21:56:36,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 21:56:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:36,467 INFO L225 Difference]: With dead ends: 110 [2019-11-21 21:56:36,467 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 21:56:36,469 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 21:56:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 21:56:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 21:56:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 21:56:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 21:56:36,516 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 21:56:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:36,516 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 21:56:36,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 21:56:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 21:56:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 21:56:36,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:36,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:36,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:36,720 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 21:56:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-21 21:56:36,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:36,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [141965052] [2019-11-21 21:56:36,723 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 21:56:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:36,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 21:56:36,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:36,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:56:36,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:36,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:36,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:36,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:56:37,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:37,033 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 21:56:37,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:37,056 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 21:56:37,057 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 21:56:37,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 21:56:37,083 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 21:56:37,083 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:37,108 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 21:56:37,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [141965052] [2019-11-21 21:56:37,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:37,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 21:56:37,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905519258] [2019-11-21 21:56:37,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 21:56:37,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:37,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 21:56:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 21:56:37,117 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 21:56:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:37,648 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 21:56:37,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:56:37,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 21:56:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:37,655 INFO L225 Difference]: With dead ends: 116 [2019-11-21 21:56:37,655 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 21:56:37,656 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 21:56:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 21:56:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 21:56:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 21:56:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 21:56:37,675 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 21:56:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:37,676 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 21:56:37,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 21:56:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 21:56:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 21:56:37,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:37,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:37,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:37,880 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 21:56:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-21 21:56:37,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:37,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639643060] [2019-11-21 21:56:37,883 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 21:56:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:38,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:56:38,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:38,122 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 21:56:38,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:38,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:38,143 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 21:56:38,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:38,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:38,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:38,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 21:56:38,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:56:38,197 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 21:56:38,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:38,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:38,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:56:38,220 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 21:56:38,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:38,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:38,233 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 21:56:38,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 21:56:38,270 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 21:56:38,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:38,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:38,588 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 21:56:38,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639643060] [2019-11-21 21:56:38,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:38,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 21:56:38,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631603184] [2019-11-21 21:56:38,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:56:38,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:56:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:56:38,590 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 21:56:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:42,264 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 21:56:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 21:56:42,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 21:56:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:42,267 INFO L225 Difference]: With dead ends: 115 [2019-11-21 21:56:42,267 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 21:56:42,268 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 21:56:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 21:56:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 21:56:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 21:56:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 21:56:42,278 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 21:56:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:42,279 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 21:56:42,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:56:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 21:56:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 21:56:42,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:42,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:42,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:42,483 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 21:56:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-21 21:56:42,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:42,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2010220328] [2019-11-21 21:56:42,485 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 21:56:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:42,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 21:56:42,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:42,653 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 21:56:42,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:42,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:42,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:42,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:56:42,669 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 21:56:42,669 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:42,691 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 21:56:42,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010220328] [2019-11-21 21:56:42,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:42,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 21:56:42,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637497123] [2019-11-21 21:56:42,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 21:56:42,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 21:56:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 21:56:42,693 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 21:56:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:42,876 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 21:56:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 21:56:42,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 21:56:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:42,878 INFO L225 Difference]: With dead ends: 108 [2019-11-21 21:56:42,878 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 21:56:42,878 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 21:56:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 21:56:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 21:56:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 21:56:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 21:56:42,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 21:56:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:42,887 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 21:56:42,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 21:56:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 21:56:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 21:56:42,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:42,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:43,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:43,093 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 21:56:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-21 21:56:43,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:43,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [718374959] [2019-11-21 21:56:43,094 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 21:56:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:43,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:56:43,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:43,288 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 21:56:43,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:43,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:43,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:43,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:56:43,307 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 21:56:43,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:43,341 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 21:56:43,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [718374959] [2019-11-21 21:56:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:43,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 21:56:43,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473022185] [2019-11-21 21:56:43,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 21:56:43,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 21:56:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 21:56:43,343 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 21:56:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:43,729 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 21:56:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 21:56:43,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 21:56:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:43,732 INFO L225 Difference]: With dead ends: 107 [2019-11-21 21:56:43,732 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 21:56:43,733 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 21:56:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 21:56:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 21:56:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 21:56:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 21:56:43,749 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 21:56:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:43,750 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 21:56:43,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 21:56:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 21:56:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 21:56:43,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:43,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:43,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:43,955 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 21:56:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-21 21:56:43,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:43,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [745567273] [2019-11-21 21:56:43,957 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 21:56:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:44,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 21:56:44,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:44,176 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 21:56:44,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:44,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:44,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:44,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:56:44,185 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 21:56:44,185 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:44,192 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 21:56:44,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745567273] [2019-11-21 21:56:44,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:44,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 21:56:44,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043475597] [2019-11-21 21:56:44,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 21:56:44,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:44,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 21:56:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 21:56:44,195 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 21:56:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:44,364 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 21:56:44,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 21:56:44,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 21:56:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:44,365 INFO L225 Difference]: With dead ends: 105 [2019-11-21 21:56:44,365 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 21:56:44,366 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 21:56:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 21:56:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 21:56:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 21:56:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 21:56:44,372 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 21:56:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:44,372 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 21:56:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 21:56:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 21:56:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 21:56:44,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:44,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:44,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:44,576 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 21:56:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-21 21:56:44,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:44,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [326679507] [2019-11-21 21:56:44,578 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 21:56:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:44,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:56:44,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:44,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 21:56:44,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:44,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:44,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:44,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:56:44,841 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 21:56:44,841 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:44,882 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 21:56:44,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [326679507] [2019-11-21 21:56:44,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:44,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 21:56:44,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656283354] [2019-11-21 21:56:44,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 21:56:44,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 21:56:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 21:56:44,884 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 21:56:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:45,236 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 21:56:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 21:56:45,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 21:56:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:45,238 INFO L225 Difference]: With dead ends: 106 [2019-11-21 21:56:45,238 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 21:56:45,239 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 21:56:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 21:56:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 21:56:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 21:56:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 21:56:45,244 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 21:56:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:45,244 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 21:56:45,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 21:56:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 21:56:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 21:56:45,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:45,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:45,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:45,449 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 21:56:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-21 21:56:45,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:45,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [73206118] [2019-11-21 21:56:45,451 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 21:56:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:45,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 21:56:45,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:45,660 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 21:56:45,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:45,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:45,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:45,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:56:45,684 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 21:56:45,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:56:45,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [73206118] [2019-11-21 21:56:45,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:45,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 21:56:45,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392608031] [2019-11-21 21:56:45,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:56:45,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:56:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:56:45,736 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 21:56:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:46,226 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 21:56:46,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:56:46,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 21:56:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:46,228 INFO L225 Difference]: With dead ends: 135 [2019-11-21 21:56:46,228 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 21:56:46,228 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 21:56:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 21:56:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 21:56:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 21:56:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 21:56:46,234 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 21:56:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:46,235 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 21:56:46,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:56:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 21:56:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 21:56:46,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:46,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:56:46,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:46,439 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 21:56:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-21 21:56:46,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:46,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1891120603] [2019-11-21 21:56:46,441 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 21:56:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:46,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 21:56:46,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:46,641 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 21:56:46,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:46,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:46,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:46,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:56:46,668 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 21:56:46,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:46,778 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 21:56:46,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1891120603] [2019-11-21 21:56:46,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:46,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 21:56:46,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738696095] [2019-11-21 21:56:46,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:56:46,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:56:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:56:46,780 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 21:56:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:47,404 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 21:56:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:56:47,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 21:56:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:47,407 INFO L225 Difference]: With dead ends: 109 [2019-11-21 21:56:47,407 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 21:56:47,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:56:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 21:56:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 21:56:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 21:56:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 21:56:47,414 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 21:56:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:47,414 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 21:56:47,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:56:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 21:56:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 21:56:47,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:47,415 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 21:56:47,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:47,626 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 21:56:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-21 21:56:47,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:47,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [607103305] [2019-11-21 21:56:47,628 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 21:56:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:47,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 21:56:47,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:47,934 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 21:56:47,934 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:47,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:56:48,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607103305] [2019-11-21 21:56:48,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:48,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 21:56:48,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873510301] [2019-11-21 21:56:48,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 21:56:48,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 21:56:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 21:56:48,026 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2019-11-21 21:56:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:48,766 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 21:56:48,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 21:56:48,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 21:56:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:48,768 INFO L225 Difference]: With dead ends: 106 [2019-11-21 21:56:48,768 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 21:56:48,768 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 21:56:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 21:56:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-21 21:56:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-21 21:56:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-11-21 21:56:48,773 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 18 [2019-11-21 21:56:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:48,773 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-11-21 21:56:48,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 21:56:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-11-21 21:56:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 21:56:48,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:48,774 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 21:56:48,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:48,977 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 21:56:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-21 21:56:48,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:48,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1514336107] [2019-11-21 21:56:48,979 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 21:56:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:49,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 21:56:49,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:49,191 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 21:56:49,192 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:49,222 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 21:56:49,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1514336107] [2019-11-21 21:56:49,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:49,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 21:56:49,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256393913] [2019-11-21 21:56:49,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 21:56:49,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 21:56:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 21:56:49,226 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2019-11-21 21:56:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:49,627 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-21 21:56:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:56:49,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 21:56:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:49,629 INFO L225 Difference]: With dead ends: 137 [2019-11-21 21:56:49,630 INFO L226 Difference]: Without dead ends: 137 [2019-11-21 21:56:49,631 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 21:56:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-21 21:56:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2019-11-21 21:56:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 21:56:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 21:56:49,635 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 21:56:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:49,636 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 21:56:49,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 21:56:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 21:56:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 21:56:49,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:49,637 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 21:56:49,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:49,845 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 21:56:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-21 21:56:49,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:49,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1160633869] [2019-11-21 21:56:49,848 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 21:56:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:50,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 21:56:50,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:50,060 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 21:56:50,060 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:50,069 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 21:56:50,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160633869] [2019-11-21 21:56:50,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:50,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 21:56:50,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673835668] [2019-11-21 21:56:50,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 21:56:50,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 21:56:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 21:56:50,071 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 21:56:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:50,123 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 21:56:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 21:56:50,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 21:56:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:50,127 INFO L225 Difference]: With dead ends: 112 [2019-11-21 21:56:50,127 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 21:56:50,128 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 21:56:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 21:56:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 21:56:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 21:56:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 21:56:50,133 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 21:56:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:50,133 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 21:56:50,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 21:56:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 21:56:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 21:56:50,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:50,139 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 21:56:50,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:50,342 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 21:56:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-21 21:56:50,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:50,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2075597975] [2019-11-21 21:56:50,345 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 21:56:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:50,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 21:56:50,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:50,576 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 21:56:50,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:50,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:56:50,621 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 21:56:50,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:50,650 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 21:56:50,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:50,666 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 21:56:50,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 21:56:50,713 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 21:56:50,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:50,727 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 21:56:50,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:50,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:50,737 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 21:56:50,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 21:56:50,754 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 21:56:50,754 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:51,078 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 21:56:51,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2075597975] [2019-11-21 21:56:51,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:51,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 21:56:51,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837839979] [2019-11-21 21:56:51,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:56:51,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:56:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:56:51,080 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 10 states. [2019-11-21 21:56:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:53,021 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-21 21:56:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 21:56:53,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 21:56:53,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:53,023 INFO L225 Difference]: With dead ends: 119 [2019-11-21 21:56:53,023 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 21:56:53,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:56:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 21:56:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2019-11-21 21:56:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 21:56:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-11-21 21:56:53,028 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 19 [2019-11-21 21:56:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:53,029 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-11-21 21:56:53,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:56:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-11-21 21:56:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 21:56:53,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:53,030 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 21:56:53,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:53,234 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 21:56:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:53,234 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-21 21:56:53,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:53,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [365367268] [2019-11-21 21:56:53,236 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 21:56:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:53,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:56:53,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:53,450 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 21:56:53,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:53,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:53,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:53,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:56:53,462 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 21:56:53,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:53,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:53,473 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 21:56:53,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 21:56:53,491 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 21:56:53,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:53,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:53,494 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 21:56:53,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 21:56:53,503 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 21:56:53,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:53,519 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 21:56:53,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [365367268] [2019-11-21 21:56:53,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:56:53,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 21:56:53,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191323262] [2019-11-21 21:56:53,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 21:56:53,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:56:53,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 21:56:53,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 21:56:53,522 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2019-11-21 21:56:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:56:53,868 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-21 21:56:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:56:53,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 21:56:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:56:53,871 INFO L225 Difference]: With dead ends: 114 [2019-11-21 21:56:53,871 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 21:56:53,872 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 21:56:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 21:56:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-11-21 21:56:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 21:56:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-21 21:56:53,876 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2019-11-21 21:56:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:56:53,876 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-21 21:56:53,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 21:56:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-21 21:56:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 21:56:53,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:56:53,877 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 21:56:54,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:56:54,080 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 21:56:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:56:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-21 21:56:54,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:56:54,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1537500766] [2019-11-21 21:56:54,082 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 21:56:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:56:54,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 21:56:54,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:56:54,326 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 21:56:54,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:54,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:54,336 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 21:56:54,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:54,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:54,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:56:54,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 21:56:54,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:56:54,397 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 21:56:54,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:54,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:54,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:54,422 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 21:56:54,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:56:54,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:56:54,436 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 21:56:54,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-21 21:56:54,460 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 21:56:54,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:56:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:54,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:54,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:56:54,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:54,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:56:58,388 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 21:56:58,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:00,921 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 21:57:01,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 21:57:01,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1537500766] [2019-11-21 21:57:01,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:57:01,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 21:57:01,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044410507] [2019-11-21 21:57:01,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:57:01,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:57:01,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:57:01,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 21:57:01,067 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 10 states. [2019-11-21 21:57:21,427 WARN L192 SmtUtils]: Spent 14.16 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 21:57:27,527 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 21:57:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:57:54,546 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-21 21:57:54,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:57:54,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 21:57:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:57:54,549 INFO L225 Difference]: With dead ends: 130 [2019-11-21 21:57:54,549 INFO L226 Difference]: Without dead ends: 130 [2019-11-21 21:57:54,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=56, Invalid=127, Unknown=3, NotChecked=24, Total=210 [2019-11-21 21:57:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-21 21:57:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2019-11-21 21:57:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 21:57:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-11-21 21:57:54,555 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 20 [2019-11-21 21:57:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:57:54,555 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-11-21 21:57:54,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:57:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-11-21 21:57:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 21:57:54,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:57:54,557 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 21:57:54,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:57:54,760 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 21:57:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:57:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-21 21:57:54,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:57:54,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1232183488] [2019-11-21 21:57:54,762 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 21:57:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:57:54,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:57:54,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:57:54,997 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 21:57:54,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:55,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 21:57:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:57:55,015 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:57:55,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:55,064 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 21:57:55,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:55,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:55,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 21:57:55,074 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 21:57:55,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:55,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:57:55,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 21:57:55,081 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 21:57:55,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1232183488] [2019-11-21 21:57:55,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:57:55,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 21:57:55,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128211393] [2019-11-21 21:57:55,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 21:57:55,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:57:55,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 21:57:55,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 21:57:55,083 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2019-11-21 21:57:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:57:55,365 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 21:57:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:57:55,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 21:57:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:57:55,368 INFO L225 Difference]: With dead ends: 113 [2019-11-21 21:57:55,368 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 21:57:55,368 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 21:57:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 21:57:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-11-21 21:57:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 21:57:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-21 21:57:55,373 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 22 [2019-11-21 21:57:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:57:55,373 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-21 21:57:55,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 21:57:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-21 21:57:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 21:57:55,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:57:55,374 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 21:57:55,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:57:55,576 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 21:57:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:57:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-21 21:57:55,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:57:55,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [795045344] [2019-11-21 21:57:55,577 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 21:57:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:57:55,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 21:57:55,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:57:55,837 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 21:57:55,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:57:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:57:55,965 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 21:57:55,965 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 21:57:55,984 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 21:57:55,984 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 21:57:56,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:56,018 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 21:57:56,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 21:57:56,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:56,186 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 21:57:56,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,188 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 21:57:56,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:56,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,237 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 21:57:56,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 21:57:56,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:56,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:57,074 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 21:57:57,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [795045344] [2019-11-21 21:57:57,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:57:57,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 21:57:57,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053717499] [2019-11-21 21:57:57,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:57:57,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:57:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:57:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:57:57,076 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-21 21:57:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:57:57,903 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-21 21:57:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:57:57,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 21:57:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:57:57,906 INFO L225 Difference]: With dead ends: 107 [2019-11-21 21:57:57,906 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 21:57:57,906 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 21:57:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 21:57:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 21:57:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 21:57:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 21:57:57,912 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-21 21:57:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:57:57,913 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 21:57:57,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:57:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 21:57:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 21:57:57,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:57:57,914 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 21:57:58,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:57:58,117 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 21:57:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:57:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-21 21:57:58,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:57:58,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1936330089] [2019-11-21 21:57:58,119 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 21:57:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:57:58,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 21:57:58,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:57:58,392 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 21:57:58,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,410 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 21:57:58,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 21:57:58,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,462 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 21:57:58,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,478 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 21:57:58,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,500 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 21:57:58,501 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 21:57:58,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 21:57:58,646 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 21:57:58,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,662 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 21:57:58,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:57:58,713 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 21:57:58,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:57:58,747 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-21 21:57:58,748 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 21:57:58,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-21 21:57:58,760 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 21:57:58,760 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:57:58,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:57:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:57:58,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:57:58,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:57:58,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:57:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:02,645 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 21:58:02,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:03,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:03,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:03,151 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 21:58:03,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:03,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:03,174 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 21:58:03,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 21:58:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:03,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936330089] [2019-11-21 21:58:03,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:58:03,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-21 21:58:03,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973982754] [2019-11-21 21:58:03,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 21:58:03,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 21:58:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-21 21:58:03,553 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2019-11-21 21:58:09,866 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 21:58:14,015 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))))))))) is different from false [2019-11-21 21:58:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:38,037 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2019-11-21 21:58:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 21:58:38,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-21 21:58:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:38,040 INFO L225 Difference]: With dead ends: 127 [2019-11-21 21:58:38,040 INFO L226 Difference]: Without dead ends: 127 [2019-11-21 21:58:38,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=56, Invalid=221, Unknown=3, NotChecked=62, Total=342 [2019-11-21 21:58:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-21 21:58:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-21 21:58:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 21:58:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-21 21:58:38,047 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 22 [2019-11-21 21:58:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:38,047 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-21 21:58:38,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 21:58:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-21 21:58:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 21:58:38,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:38,049 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 21:58:38,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:38,250 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 21:58:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-21 21:58:38,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:38,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1597376725] [2019-11-21 21:58:38,252 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 21:58:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:38,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 21:58:38,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:38,499 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 21:58:38,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,511 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 21:58:38,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 21:58:38,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,620 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 21:58:38,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,641 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 21:58:38,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,665 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 21:58:38,666 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 21:58:38,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 21:58:38,741 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 21:58:38,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,754 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 21:58:38,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:38,799 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 21:58:38,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:38,834 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 21:58:38,835 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 21:58:38,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 21:58:38,878 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 21:58:38,879 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:38,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:39,568 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 21:58:39,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:39,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:39,596 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 21:58:39,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:39,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:39,619 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 21:58:39,619 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:39,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:39,687 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 21:58:39,687 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 21:58:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:39,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:39,825 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 21:58:39,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 21:58:41,324 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 21:58:41,329 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 21:58:41,333 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 21:58:41,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 21:58:41,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 21:58:41,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 21:58:41,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:41,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:41,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:41,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-21 21:58:41,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 21:58:41,519 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 21:58:41,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:41,723 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 21:58:41,731 INFO L168 Benchmark]: Toolchain (without parser) took 127519.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. [2019-11-21 21:58:41,731 INFO L168 Benchmark]: CDTParser took 0.36 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 21:58:41,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-21 21:58:41,732 INFO L168 Benchmark]: Boogie Preprocessor took 82.95 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 21:58:41,732 INFO L168 Benchmark]: RCFGBuilder took 1033.40 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-21 21:58:41,733 INFO L168 Benchmark]: TraceAbstraction took 125714.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. [2019-11-21 21:58:41,740 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.36 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 683.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.95 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 1033.40 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125714.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 95.0 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...