./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 34ebb1e4 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-34ebb1e [2019-11-21 16:20:21,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 16:20:21,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 16:20:21,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 16:20:21,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 16:20:21,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 16:20:21,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 16:20:21,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 16:20:21,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 16:20:21,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 16:20:21,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 16:20:21,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 16:20:21,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 16:20:21,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 16:20:21,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 16:20:21,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 16:20:21,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 16:20:21,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 16:20:21,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 16:20:21,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 16:20:21,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 16:20:21,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 16:20:21,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 16:20:21,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 16:20:21,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 16:20:21,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 16:20:21,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 16:20:21,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 16:20:21,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 16:20:21,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 16:20:21,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 16:20:21,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 16:20:21,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 16:20:21,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 16:20:21,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 16:20:21,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 16:20:21,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 16:20:21,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 16:20:21,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 16:20:21,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 16:20:21,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 16:20:21,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 16:20:21,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 16:20:21,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 16:20:21,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 16:20:21,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 16:20:21,975 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 16:20:21,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 16:20:21,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 16:20:21,975 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 16:20:21,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 16:20:21,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 16:20:21,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 16:20:21,977 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 16:20:21,977 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 16:20:21,977 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 16:20:21,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 16:20:21,978 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 16:20:21,978 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 16:20:21,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 16:20:21,978 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 16:20:21,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 16:20:21,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 16:20:21,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 16:20:21,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 16:20:21,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 16:20:21,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 16:20:21,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 16:20:21,981 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 16:20:21,981 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 16:20:21,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 16:20:21,981 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 16:20:22,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 16:20:22,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 16:20:22,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 16:20:22,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 16:20:22,290 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 16:20:22,291 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 16:20:22,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037c81758/f5035fbdbc26452a9478ac46e53d3bf4/FLAG74f27afad [2019-11-21 16:20:22,824 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 16:20:22,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 16:20:22,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037c81758/f5035fbdbc26452a9478ac46e53d3bf4/FLAG74f27afad [2019-11-21 16:20:23,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037c81758/f5035fbdbc26452a9478ac46e53d3bf4 [2019-11-21 16:20:23,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 16:20:23,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 16:20:23,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 16:20:23,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 16:20:23,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 16:20:23,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d804259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23, skipping insertion in model container [2019-11-21 16:20:23,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 16:20:23,245 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 16:20:23,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:20:23,678 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 16:20:23,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:20:23,806 INFO L205 MainTranslator]: Completed translation [2019-11-21 16:20:23,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23 WrapperNode [2019-11-21 16:20:23,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 16:20:23,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 16:20:23,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 16:20:23,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 16:20:23,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (1/1) ... [2019-11-21 16:20:23,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 16:20:23,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 16:20:23,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 16:20:23,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 16:20:23,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (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 16:20:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 16:20:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 16:20:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 16:20:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 16:20:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 16:20:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 16:20:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 16:20:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 16:20:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 16:20:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 16:20:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 16:20:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 16:20:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 16:20:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 16:20:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 16:20:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 16:20:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 16:20:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 16:20:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 16:20:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 16:20:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 16:20:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 16:20:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 16:20:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 16:20:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 16:20:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 16:20:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 16:20:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 16:20:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 16:20:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 16:20:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 16:20:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 16:20:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 16:20:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 16:20:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 16:20:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 16:20:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 16:20:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 16:20:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 16:20:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 16:20:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 16:20:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 16:20:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 16:20:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 16:20:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 16:20:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 16:20:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 16:20:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 16:20:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 16:20:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 16:20:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 16:20:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 16:20:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 16:20:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 16:20:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 16:20:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 16:20:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 16:20:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 16:20:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 16:20:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 16:20:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 16:20:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 16:20:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 16:20:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 16:20:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 16:20:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 16:20:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 16:20:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 16:20:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 16:20:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 16:20:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 16:20:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 16:20:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 16:20:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 16:20:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 16:20:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 16:20:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 16:20:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 16:20:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 16:20:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 16:20:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 16:20:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 16:20:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 16:20:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 16:20:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 16:20:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 16:20:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 16:20:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 16:20:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 16:20:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 16:20:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 16:20:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 16:20:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 16:20:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 16:20:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 16:20:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 16:20:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 16:20:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 16:20:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 16:20:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 16:20:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 16:20:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 16:20:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 16:20:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 16:20:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 16:20:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 16:20:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 16:20:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 16:20:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 16:20:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 16:20:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 16:20:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 16:20:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 16:20:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 16:20:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 16:20:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 16:20:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 16:20:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 16:20:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 16:20:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 16:20:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 16:20:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 16:20:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 16:20:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 16:20:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 16:20:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 16:20:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 16:20:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 16:20:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 16:20:24,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 16:20:24,826 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 16:20:24,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:20:24 BoogieIcfgContainer [2019-11-21 16:20:24,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 16:20:24,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 16:20:24,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 16:20:24,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 16:20:24,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:20:23" (1/3) ... [2019-11-21 16:20:24,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6eb184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:20:24, skipping insertion in model container [2019-11-21 16:20:24,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:20:23" (2/3) ... [2019-11-21 16:20:24,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6eb184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:20:24, skipping insertion in model container [2019-11-21 16:20:24,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:20:24" (3/3) ... [2019-11-21 16:20:24,840 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-21 16:20:24,852 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 16:20:24,871 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 16:20:24,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 16:20:24,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 16:20:24,906 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 16:20:24,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 16:20:24,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 16:20:24,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 16:20:24,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 16:20:24,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 16:20:24,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 16:20:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 16:20:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 16:20:24,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:24,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:24,949 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 16:20:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 16:20:24,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:24,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [445500734] [2019-11-21 16:20:24,970 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 16:20:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:25,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 16:20:25,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:25,218 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 16:20:25,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:25,238 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 16:20:25,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445500734] [2019-11-21 16:20:25,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:25,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 16:20:25,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218479823] [2019-11-21 16:20:25,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 16:20:25,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 16:20:25,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 16:20:25,267 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 16:20:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:25,292 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 16:20:25,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 16:20:25,294 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 16:20:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:25,306 INFO L225 Difference]: With dead ends: 110 [2019-11-21 16:20:25,306 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 16:20:25,308 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 16:20:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 16:20:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 16:20:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 16:20:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 16:20:25,361 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 16:20:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:25,361 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 16:20:25,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 16:20:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 16:20:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:20:25,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:25,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:25,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:25,568 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 16:20:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:25,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 16:20:25,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:25,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [955184489] [2019-11-21 16:20:25,571 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 16:20:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:25,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:20:25,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:25,835 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 16:20:25,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:25,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:25,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:25,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:20:25,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:25,911 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 16:20:25,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:25,939 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:20:25,940 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 16:20:25,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 16:20:25,964 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 16:20:25,964 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955184489] [2019-11-21 16:20:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 16:20:25,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493142649] [2019-11-21 16:20:25,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 16:20:25,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:25,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 16:20:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:20:25,994 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 16:20:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:26,569 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 16:20:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 16:20:26,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 16:20:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:26,580 INFO L225 Difference]: With dead ends: 116 [2019-11-21 16:20:26,583 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 16:20:26,585 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 16:20:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 16:20:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 16:20:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 16:20:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 16:20:26,617 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 16:20:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:26,617 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 16:20:26,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 16:20:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 16:20:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:20:26,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:26,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:26,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:26,822 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 16:20:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 16:20:26,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:26,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [957402150] [2019-11-21 16:20:26,825 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 16:20:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:27,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 16:20:27,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:27,062 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 16:20:27,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:27,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:27,083 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 16:20:27,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:27,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:27,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:27,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:20:27,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:20:27,146 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 16:20:27,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:27,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:27,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:20:27,168 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 16:20:27,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:27,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:27,178 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 16:20:27,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 16:20:27,198 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 16:20:27,198 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:27,510 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 16:20:27,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957402150] [2019-11-21 16:20:27,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:27,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 16:20:27,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475657939] [2019-11-21 16:20:27,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 16:20:27,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 16:20:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:20:27,512 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 16:20:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:31,490 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 16:20:31,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 16:20:31,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 16:20:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:31,494 INFO L225 Difference]: With dead ends: 115 [2019-11-21 16:20:31,494 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 16:20:31,494 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 16:20:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 16:20:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 16:20:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 16:20:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 16:20:31,506 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 16:20:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:31,506 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 16:20:31,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 16:20:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 16:20:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 16:20:31,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:31,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:31,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:31,711 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 16:20:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 16:20:31,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:31,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [565592447] [2019-11-21 16:20:31,714 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 16:20:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:31,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:20:31,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:31,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:20:31,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:31,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:31,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:31,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:20:31,927 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 16:20:31,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:31,948 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 16:20:31,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [565592447] [2019-11-21 16:20:31,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:31,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 16:20:31,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319145287] [2019-11-21 16:20:31,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:20:31,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:20:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:20:31,951 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 16:20:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:32,140 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 16:20:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:20:32,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 16:20:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:32,142 INFO L225 Difference]: With dead ends: 108 [2019-11-21 16:20:32,142 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 16:20:32,142 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 16:20:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 16:20:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 16:20:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 16:20:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 16:20:32,152 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 16:20:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:32,152 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 16:20:32,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:20:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 16:20:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 16:20:32,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:32,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:32,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:32,356 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 16:20:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 16:20:32,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:32,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [59416834] [2019-11-21 16:20:32,359 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 16:20:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:32,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:20:32,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:32,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:20:32,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:32,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:32,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:32,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:20:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:32,562 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:32,596 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 16:20:32,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [59416834] [2019-11-21 16:20:32,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:32,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 16:20:32,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237168155] [2019-11-21 16:20:32,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:20:32,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:20:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:20:32,599 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 16:20:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:32,997 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 16:20:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:20:32,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 16:20:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:32,999 INFO L225 Difference]: With dead ends: 107 [2019-11-21 16:20:32,999 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 16:20:33,000 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 16:20:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 16:20:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 16:20:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 16:20:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 16:20:33,009 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 16:20:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:33,009 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 16:20:33,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:20:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 16:20:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 16:20:33,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:33,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:33,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:33,214 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 16:20:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 16:20:33,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:33,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1185750390] [2019-11-21 16:20:33,216 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 16:20:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:33,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:20:33,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:33,435 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 16:20:33,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:33,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:33,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:33,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:20:33,444 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 16:20:33,445 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:33,452 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 16:20:33,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1185750390] [2019-11-21 16:20:33,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:33,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 16:20:33,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915719078] [2019-11-21 16:20:33,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 16:20:33,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 16:20:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:20:33,454 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 16:20:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:33,667 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 16:20:33,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:20:33,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 16:20:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:33,669 INFO L225 Difference]: With dead ends: 105 [2019-11-21 16:20:33,669 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 16:20:33,670 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 16:20:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 16:20:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 16:20:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 16:20:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 16:20:33,676 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 16:20:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:33,677 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 16:20:33,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 16:20:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 16:20:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 16:20:33,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:33,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:33,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:33,882 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 16:20:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 16:20:33,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:33,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1103509341] [2019-11-21 16:20:33,884 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 16:20:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:34,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:20:34,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:34,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:20:34,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:34,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:34,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:34,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:20:34,104 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 16:20:34,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:34,137 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 16:20:34,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103509341] [2019-11-21 16:20:34,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:34,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 16:20:34,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596713095] [2019-11-21 16:20:34,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:20:34,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:20:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:20:34,139 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 16:20:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:34,505 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 16:20:34,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 16:20:34,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 16:20:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:34,507 INFO L225 Difference]: With dead ends: 106 [2019-11-21 16:20:34,507 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 16:20:34,507 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 16:20:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 16:20:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 16:20:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 16:20:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 16:20:34,513 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 16:20:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:34,514 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 16:20:34,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:20:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 16:20:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 16:20:34,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:34,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:34,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:34,718 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 16:20:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 16:20:34,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:34,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2146243772] [2019-11-21 16:20:34,720 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 16:20:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:34,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 16:20:34,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:34,918 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 16:20:34,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:34,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:34,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:34,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:20:34,936 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 16:20:34,936 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:34,991 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 16:20:34,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2146243772] [2019-11-21 16:20:34,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:34,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 16:20:34,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679994736] [2019-11-21 16:20:34,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 16:20:34,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 16:20:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 16:20:34,993 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 16:20:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:35,509 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 16:20:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:20:35,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 16:20:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:35,511 INFO L225 Difference]: With dead ends: 135 [2019-11-21 16:20:35,511 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 16:20:35,512 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 16:20:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 16:20:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 16:20:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 16:20:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 16:20:35,518 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 16:20:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:35,518 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 16:20:35,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 16:20:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 16:20:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 16:20:35,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:35,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:35,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:35,723 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 16:20:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 16:20:35,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:35,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [686565017] [2019-11-21 16:20:35,725 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 16:20:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:35,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:20:35,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:35,922 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 16:20:35,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:35,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:35,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:35,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:20:35,945 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 16:20:35,945 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:36,033 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 16:20:36,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [686565017] [2019-11-21 16:20:36,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:36,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 16:20:36,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400141558] [2019-11-21 16:20:36,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 16:20:36,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 16:20:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 16:20:36,035 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 16:20:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:36,671 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 16:20:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:20:36,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 16:20:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:36,673 INFO L225 Difference]: With dead ends: 109 [2019-11-21 16:20:36,674 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 16:20:36,674 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 16:20:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 16:20:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 16:20:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 16:20:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 16:20:36,680 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 16:20:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:36,681 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 16:20:36,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 16:20:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 16:20:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 16:20:36,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:36,682 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 16:20:36,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:36,886 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 16:20:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 16:20:36,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:36,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1212255096] [2019-11-21 16:20:36,887 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 16:20:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:37,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:20:37,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:37,130 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 16:20:37,130 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:37,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1212255096] [2019-11-21 16:20:37,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:37,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 16:20:37,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873793357] [2019-11-21 16:20:37,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 16:20:37,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 16:20:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:20:37,167 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 16:20:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:37,581 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 16:20:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:20:37,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 16:20:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:37,585 INFO L225 Difference]: With dead ends: 135 [2019-11-21 16:20:37,585 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 16:20:37,585 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 16:20:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 16:20:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 16:20:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 16:20:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 16:20:37,591 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 16:20:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:37,591 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 16:20:37,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 16:20:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 16:20:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 16:20:37,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:37,592 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 16:20:37,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:37,795 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 16:20:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 16:20:37,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:37,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [612738927] [2019-11-21 16:20:37,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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 16:20:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:38,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 16:20:38,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:38,088 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 16:20:38,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:38,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:38,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [612738927] [2019-11-21 16:20:38,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:38,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 16:20:38,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347984281] [2019-11-21 16:20:38,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 16:20:38,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:38,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 16:20:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 16:20:38,181 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 16:20:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:39,143 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 16:20:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 16:20:39,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 16:20:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:39,145 INFO L225 Difference]: With dead ends: 104 [2019-11-21 16:20:39,145 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 16:20:39,146 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 16:20:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 16:20:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 16:20:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 16:20:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 16:20:39,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 16:20:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:39,151 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 16:20:39,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 16:20:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 16:20:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 16:20:39,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:39,152 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 16:20:39,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:39,355 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 16:20:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 16:20:39,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:39,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1043475597] [2019-11-21 16:20:39,357 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 16:20:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:39,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 16:20:39,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:39,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:39,574 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 16:20:39,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1043475597] [2019-11-21 16:20:39,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:39,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 16:20:39,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689334771] [2019-11-21 16:20:39,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:20:39,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:20:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:20:39,576 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 16:20:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:39,618 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 16:20:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 16:20:39,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 16:20:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:39,625 INFO L225 Difference]: With dead ends: 112 [2019-11-21 16:20:39,625 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 16:20:39,626 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 16:20:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 16:20:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 16:20:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 16:20:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 16:20:39,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 16:20:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:39,631 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 16:20:39,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:20:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 16:20:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:20:39,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:39,638 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 16:20:39,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:39,841 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 16:20:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 16:20:39,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:39,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1065702469] [2019-11-21 16:20:39,843 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 16:20:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:40,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:20:40,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:40,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:20:40,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:40,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:40,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:40,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:20:40,093 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 16:20:40,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:40,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:40,104 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 16:20:40,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 16:20:40,126 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 16:20:40,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:40,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:40,135 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 16:20:40,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 16:20:40,145 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 16:20:40,145 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:40,159 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 16:20:40,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1065702469] [2019-11-21 16:20:40,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:40,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 16:20:40,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229803865] [2019-11-21 16:20:40,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 16:20:40,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 16:20:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:20:40,161 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 16:20:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:40,595 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-21 16:20:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 16:20:40,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 16:20:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:40,598 INFO L225 Difference]: With dead ends: 114 [2019-11-21 16:20:40,599 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 16:20:40,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:20:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 16:20:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-21 16:20:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 16:20:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-21 16:20:40,603 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-21 16:20:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:40,603 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-21 16:20:40,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 16:20:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-21 16:20:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:20:40,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:40,604 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 16:20:40,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:40,807 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 16:20:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 16:20:40,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:40,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1237129480] [2019-11-21 16:20:40,809 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 16:20:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:41,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 16:20:41,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:41,041 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 16:20:41,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:41,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:20:41,067 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 16:20:41,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:41,088 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 16:20:41,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:41,105 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 16:20:41,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 16:20:41,171 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 16:20:41,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:41,187 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 16:20:41,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:41,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:41,197 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 16:20:41,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 16:20:41,213 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 16:20:41,214 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:20:41,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1237129480] [2019-11-21 16:20:41,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:41,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:20:41,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55077198] [2019-11-21 16:20:41,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:20:41,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:20:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:20:41,523 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-21 16:20:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:20:43,176 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 16:20:43,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:20:43,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 16:20:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:20:43,178 INFO L225 Difference]: With dead ends: 113 [2019-11-21 16:20:43,178 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 16:20:43,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-21 16:20:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 16:20:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-21 16:20:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 16:20:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-21 16:20:43,183 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-21 16:20:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:20:43,183 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-21 16:20:43,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:20:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-21 16:20:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 16:20:43,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:20:43,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:20:43,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:43,389 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 16:20:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:20:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 16:20:43,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:20:43,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1837481511] [2019-11-21 16:20:43,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:20:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:20:43,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 16:20:43,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:20:43,619 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 16:20:43,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:43,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:43,631 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 16:20:43,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:43,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:43,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:20:43,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:20:43,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:20:43,710 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 16:20:43,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:43,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:43,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:43,738 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 16:20:43,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:20:43,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:20:43,752 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 16:20:43,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-21 16:20:43,782 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 16:20:43,782 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:20:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:44,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:44,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:44,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:44,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:44,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:44,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:20:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:47,407 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 16:20:47,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:20:49,785 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 16:20:49,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837481511] [2019-11-21 16:20:49,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:20:49,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:20:49,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341339615] [2019-11-21 16:20:49,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:20:49,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:20:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:20:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 16:20:49,788 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-21 16:20:55,955 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-21 16:21:00,049 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 16:21:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:19,582 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-21 16:21:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 16:21:19,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 16:21:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:19,584 INFO L225 Difference]: With dead ends: 129 [2019-11-21 16:21:19,584 INFO L226 Difference]: Without dead ends: 129 [2019-11-21 16:21:19,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=3, NotChecked=42, Total=182 [2019-11-21 16:21:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-21 16:21:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-21 16:21:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 16:21:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-21 16:21:19,590 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-21 16:21:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:19,591 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-21 16:21:19,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:21:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-21 16:21:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 16:21:19,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:19,592 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 16:21:19,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:19,793 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 16:21:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 16:21:19,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:19,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [256393913] [2019-11-21 16:21:19,796 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 16:21:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:20,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:21:20,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:20,019 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 16:21:20,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:20,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 16:21:20,035 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 16:21:20,035 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:20,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:20,117 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 16:21:20,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:20,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:20,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 16:21:20,130 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 16:21:20,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:20,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:20,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 16:21:20,138 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 16:21:20,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [256393913] [2019-11-21 16:21:20,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:20,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 16:21:20,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680636185] [2019-11-21 16:21:20,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 16:21:20,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 16:21:20,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:21:20,139 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-21 16:21:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:20,431 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 16:21:20,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 16:21:20,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 16:21:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:20,433 INFO L225 Difference]: With dead ends: 112 [2019-11-21 16:21:20,433 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 16:21:20,433 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 16:21:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 16:21:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-21 16:21:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 16:21:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-21 16:21:20,437 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-21 16:21:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:20,437 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-21 16:21:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 16:21:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-21 16:21:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 16:21:20,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:20,438 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 16:21:20,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:20,639 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 16:21:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 16:21:20,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:20,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [256613976] [2019-11-21 16:21:20,642 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 16:21:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:20,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:21:20,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:20,937 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 16:21:20,937 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:21,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:21,073 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 16:21:21,074 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 16:21:21,079 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 16:21:21,080 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 16:21:21,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:21,108 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 16:21:21,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 16:21:21,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:21,263 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 16:21:21,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,265 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 16:21:21,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:21,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,309 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 16:21:21,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 16:21:21,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:21,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:22,195 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 16:21:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [256613976] [2019-11-21 16:21:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:21:22,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607724367] [2019-11-21 16:21:22,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:21:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:21:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:21:22,196 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-21 16:21:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:22,655 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-21 16:21:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 16:21:22,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 16:21:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:22,657 INFO L225 Difference]: With dead ends: 106 [2019-11-21 16:21:22,657 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 16:21:22,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 16:21:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 16:21:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-21 16:21:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 16:21:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-21 16:21:22,662 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-21 16:21:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:22,663 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-21 16:21:22,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:21:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-21 16:21:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 16:21:22,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:22,664 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 16:21:22,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:22,868 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 16:21:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 16:21:22,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:22,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [828320471] [2019-11-21 16:21:22,869 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 16:21:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:23,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 16:21:23,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:23,113 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 16:21:23,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,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 16:21:23,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:21:23,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,175 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 16:21:23,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,194 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 16:21:23,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,212 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 16:21:23,212 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 16:21:23,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 16:21:23,325 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 16:21:23,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,348 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 16:21:23,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:23,402 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 16:21:23,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:23,438 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-21 16:21:23,440 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 16:21:23,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-21 16:21:23,457 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 16:21:23,457 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:26,559 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 16:21:26,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:21:30,924 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 16:21:31,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:31,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:31,049 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 16:21:31,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:31,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:31,079 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 16:21:31,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 16:21:31,411 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 16:21:31,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [828320471] [2019-11-21 16:21:31,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:31,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-21 16:21:31,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082567702] [2019-11-21 16:21:31,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 16:21:31,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 16:21:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2019-11-21 16:21:31,413 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-21 16:21:37,662 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 16:21:40,343 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 16:22:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:09,528 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-11-21 16:22:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 16:22:09,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-21 16:22:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:09,531 INFO L225 Difference]: With dead ends: 126 [2019-11-21 16:22:09,531 INFO L226 Difference]: Without dead ends: 126 [2019-11-21 16:22:09,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=56, Invalid=220, Unknown=4, NotChecked=62, Total=342 [2019-11-21 16:22:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-21 16:22:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-11-21 16:22:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 16:22:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-21 16:22:09,538 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 22 [2019-11-21 16:22:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:09,538 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-21 16:22:09,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 16:22:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-21 16:22:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 16:22:09,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:09,540 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 16:22:09,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:09,743 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 16:22:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:09,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 16:22:09,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:09,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1362092863] [2019-11-21 16:22:09,744 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 16:22:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:09,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 16:22:09,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:09,989 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 16:22:09,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:09,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,002 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 16:22:10,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:22:10,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,130 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 16:22:10,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,148 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 16:22:10,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,171 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 16:22:10,172 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 16:22:10,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 16:22:10,245 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 16:22:10,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,256 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 16:22:10,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,310 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 16:22:10,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,350 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 16:22:10,350 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 16:22:10,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 16:22:10,392 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 16:22:10,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:10,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:10,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:10,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,915 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 16:22:10,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,962 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 16:22:10,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:10,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:10,986 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 16:22:10,987 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:11,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:11,067 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 16:22:11,068 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 16:22:11,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:11,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:11,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:11,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:11,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:11,218 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 16:22:11,226 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 16:22:12,427 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 16:22:12,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 16:22:12,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 16:22:12,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 16:22:12,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 16:22:12,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 16:22:12,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:12,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:12,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:12,732 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-21 16:22:12,743 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 16:22:12,749 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 16:22:12,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:12,959 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 16:22:12,968 INFO L168 Benchmark]: Toolchain (without parser) took 109784.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -220.4 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:12,969 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:22:12,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:12,969 INFO L168 Benchmark]: Boogie Preprocessor took 76.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:22:12,970 INFO L168 Benchmark]: RCFGBuilder took 942.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:12,970 INFO L168 Benchmark]: TraceAbstraction took 108137.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:22:12,972 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 942.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108137.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.3 MB). There was no memory consumed. 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...