./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 678e0110 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-678e011 [2019-11-20 11:08:32,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:08:32,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:08:32,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:08:32,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:08:32,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:08:32,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:08:32,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:08:32,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:08:32,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:08:32,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:08:32,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:08:32,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:08:32,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:08:32,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:08:32,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:08:32,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:08:32,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:08:32,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:08:32,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:08:32,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:08:32,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:08:32,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:08:32,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:08:32,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:08:32,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:08:32,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:08:32,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:08:32,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:08:32,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:08:32,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:08:32,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:08:32,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:08:32,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:08:32,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:08:32,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:08:32,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:08:32,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:08:32,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:08:32,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:08:32,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:08:32,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 11:08:33,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:08:33,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:08:33,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:08:33,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:08:33,019 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:08:33,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:08:33,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:08:33,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:08:33,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:08:33,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:08:33,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:08:33,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 11:08:33,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 11:08:33,021 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 11:08:33,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:08:33,023 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:08:33,023 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:08:33,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:08:33,024 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:08:33,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:08:33,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:08:33,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:08:33,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:08:33,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:08:33,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:08:33,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:08:33,025 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:08:33,026 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:08:33,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:08:33,026 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-20 11:08:33,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:08:33,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:08:33,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:08:33,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:08:33,388 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:08:33,388 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-20 11:08:33,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b0ba767/cd3ab117a89b489e8e5f0d89ad65d95c/FLAG2ebc47436 [2019-11-20 11:08:33,940 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:08:33,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 11:08:33,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b0ba767/cd3ab117a89b489e8e5f0d89ad65d95c/FLAG2ebc47436 [2019-11-20 11:08:34,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b0ba767/cd3ab117a89b489e8e5f0d89ad65d95c [2019-11-20 11:08:34,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:08:34,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 11:08:34,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:34,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:08:34,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:08:34,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e87e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34, skipping insertion in model container [2019-11-20 11:08:34,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:08:34,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:08:34,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:34,840 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:08:34,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:34,976 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:08:34,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34 WrapperNode [2019-11-20 11:08:34,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:34,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:08:34,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:08:34,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:08:34,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:35,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:08:35,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:08:35,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:08:35,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:08:35,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:08:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 11:08:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 11:08:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 11:08:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 11:08:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 11:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 11:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 11:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 11:08:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 11:08:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 11:08:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 11:08:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 11:08:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 11:08:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 11:08:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 11:08:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 11:08:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 11:08:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 11:08:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 11:08:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 11:08:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 11:08:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 11:08:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:08:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:08:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:08:36,062 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:08:36,062 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 11:08:36,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:36 BoogieIcfgContainer [2019-11-20 11:08:36,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:08:36,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:08:36,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:08:36,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:08:36,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:08:34" (1/3) ... [2019-11-20 11:08:36,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd2aa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:08:36, skipping insertion in model container [2019-11-20 11:08:36,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (2/3) ... [2019-11-20 11:08:36,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd2aa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:08:36, skipping insertion in model container [2019-11-20 11:08:36,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:36" (3/3) ... [2019-11-20 11:08:36,075 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-20 11:08:36,086 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:08:36,097 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 11:08:36,117 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 11:08:36,139 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:08:36,140 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 11:08:36,140 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:08:36,140 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:08:36,141 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:08:36,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:08:36,141 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:08:36,141 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:08:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 11:08:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 11:08:36,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:36,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:36,173 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-20 11:08:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 11:08:36,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:36,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [390872111] [2019-11-20 11:08:36,192 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-20 11:08:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:36,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 11:08:36,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:36,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:36,478 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-20 11:08:36,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [390872111] [2019-11-20 11:08:36,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:36,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:08:36,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833483778] [2019-11-20 11:08:36,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 11:08:36,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 11:08:36,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:08:36,509 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 11:08:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:36,546 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 11:08:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:08:36,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 11:08:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:36,560 INFO L225 Difference]: With dead ends: 110 [2019-11-20 11:08:36,561 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 11:08:36,565 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-20 11:08:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 11:08:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 11:08:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 11:08:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 11:08:36,613 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 11:08:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:36,613 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 11:08:36,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 11:08:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 11:08:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:08:36,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:36,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:36,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:36,818 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-20 11:08:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 11:08:36,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:36,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1409541620] [2019-11-20 11:08:36,821 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-20 11:08:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:37,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:08:37,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:37,097 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-20 11:08:37,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:37,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:37,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:37,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:08:37,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:37,157 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-20 11:08:37,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:37,180 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 11:08:37,182 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-20 11:08:37,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 11:08:37,199 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-20 11:08:37,199 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:37,229 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-20 11:08:37,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409541620] [2019-11-20 11:08:37,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:08:37,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480116391] [2019-11-20 11:08:37,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:08:37,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:37,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:08:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:08:37,235 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 11:08:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:37,799 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 11:08:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:08:37,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 11:08:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:37,806 INFO L225 Difference]: With dead ends: 116 [2019-11-20 11:08:37,807 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 11:08:37,808 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-20 11:08:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 11:08:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 11:08:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 11:08:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 11:08:37,848 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 11:08:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:37,849 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 11:08:37,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:08:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 11:08:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:08:37,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:37,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:38,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:38,053 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-20 11:08:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 11:08:38,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:38,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1449465395] [2019-11-20 11:08:38,055 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-20 11:08:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:38,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 11:08:38,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:38,279 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-20 11:08:38,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:38,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:38,296 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-20 11:08:38,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:38,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:38,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:38,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:08:38,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:08:38,381 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-20 11:08:38,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:38,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:38,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:08:38,419 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-20 11:08:38,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:38,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:38,435 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-20 11:08:38,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 11:08:38,461 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-20 11:08:38,461 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:38,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:38,821 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-20 11:08:38,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449465395] [2019-11-20 11:08:38,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:38,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 11:08:38,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573991792] [2019-11-20 11:08:38,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:08:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:08:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:08:38,826 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 11:08:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:42,736 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 11:08:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:08:42,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 11:08:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:42,738 INFO L225 Difference]: With dead ends: 115 [2019-11-20 11:08:42,738 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 11:08:42,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:08:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 11:08:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 11:08:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 11:08:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 11:08:42,748 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 11:08:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:42,748 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 11:08:42,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:08:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 11:08:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 11:08:42,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:42,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:42,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:42,952 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-20 11:08:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 11:08:42,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:42,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [983193477] [2019-11-20 11:08:42,955 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-20 11:08:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:43,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:08:43,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:43,130 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-20 11:08:43,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:43,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:43,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:43,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:08:43,147 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-20 11:08:43,147 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:43,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-20 11:08:43,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983193477] [2019-11-20 11:08:43,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:43,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 11:08:43,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728123472] [2019-11-20 11:08:43,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:43,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:43,184 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 11:08:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:43,374 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 11:08:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:08:43,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 11:08:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:43,377 INFO L225 Difference]: With dead ends: 108 [2019-11-20 11:08:43,377 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 11:08:43,378 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-20 11:08:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 11:08:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 11:08:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 11:08:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 11:08:43,385 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 11:08:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:43,386 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 11:08:43,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 11:08:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 11:08:43,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:43,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:43,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:43,591 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-20 11:08:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 11:08:43,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:43,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1601669470] [2019-11-20 11:08:43,594 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-20 11:08:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:43,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:08:43,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:43,792 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-20 11:08:43,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:43,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:43,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:43,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:08:43,819 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-20 11:08:43,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:43,871 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-20 11:08:43,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601669470] [2019-11-20 11:08:43,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:43,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 11:08:43,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537530501] [2019-11-20 11:08:43,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:43,875 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 11:08:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:44,320 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 11:08:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:08:44,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 11:08:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:44,322 INFO L225 Difference]: With dead ends: 107 [2019-11-20 11:08:44,322 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 11:08:44,323 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-20 11:08:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 11:08:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 11:08:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 11:08:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 11:08:44,337 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 11:08:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:44,337 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 11:08:44,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 11:08:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:08:44,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:44,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:44,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:44,549 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-20 11:08:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 11:08:44,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:44,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1756906425] [2019-11-20 11:08:44,552 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-20 11:08:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:44,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:08:44,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:44,771 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-20 11:08:44,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:44,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:44,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:44,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:08:44,779 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-20 11:08:44,780 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:44,788 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-20 11:08:44,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1756906425] [2019-11-20 11:08:44,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:44,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:08:44,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528768745] [2019-11-20 11:08:44,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:08:44,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:08:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:08:44,790 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 11:08:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:44,953 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 11:08:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:08:44,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 11:08:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:44,954 INFO L225 Difference]: With dead ends: 105 [2019-11-20 11:08:44,954 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 11:08:44,955 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-20 11:08:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 11:08:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 11:08:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 11:08:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 11:08:44,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 11:08:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:44,964 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 11:08:44,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:08:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 11:08:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:08:44,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:44,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:45,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:45,168 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-20 11:08:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 11:08:45,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:45,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1784612603] [2019-11-20 11:08:45,170 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-20 11:08:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:45,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:08:45,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:45,379 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-20 11:08:45,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:45,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:45,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:45,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:08:45,404 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-20 11:08:45,405 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:45,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-20 11:08:45,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784612603] [2019-11-20 11:08:45,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:45,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 11:08:45,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916894590] [2019-11-20 11:08:45,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:45,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:45,454 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 11:08:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:45,874 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 11:08:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:45,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 11:08:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:45,877 INFO L225 Difference]: With dead ends: 106 [2019-11-20 11:08:45,878 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 11:08:45,878 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-20 11:08:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 11:08:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 11:08:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 11:08:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 11:08:45,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 11:08:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:45,884 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 11:08:45,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 11:08:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 11:08:45,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:45,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:46,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:46,089 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-20 11:08:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 11:08:46,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:46,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2136095175] [2019-11-20 11:08:46,091 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-20 11:08:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:46,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:08:46,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:46,284 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-20 11:08:46,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:46,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:46,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:46,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:08:46,309 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-20 11:08:46,309 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:46,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136095175] [2019-11-20 11:08:46,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:46,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 11:08:46,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777101920] [2019-11-20 11:08:46,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:08:46,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:08:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:08:46,379 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 11:08:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:46,934 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 11:08:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:08:46,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 11:08:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:46,936 INFO L225 Difference]: With dead ends: 135 [2019-11-20 11:08:46,936 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 11:08:46,937 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-20 11:08:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 11:08:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 11:08:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 11:08:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 11:08:46,943 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 11:08:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:46,943 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 11:08:46,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:08:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 11:08:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 11:08:46,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:46,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:47,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:47,147 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-20 11:08:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 11:08:47,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:47,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1497702836] [2019-11-20 11:08:47,149 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-20 11:08:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:47,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:08:47,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:47,346 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-20 11:08:47,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:47,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:47,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:47,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:08:47,385 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-20 11:08:47,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:47,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:47,465 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-20 11:08:47,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1497702836] [2019-11-20 11:08:47,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:47,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 11:08:47,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888067578] [2019-11-20 11:08:47,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:08:47,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:08:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:08:47,467 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 11:08:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:48,122 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 11:08:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:08:48,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 11:08:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:48,125 INFO L225 Difference]: With dead ends: 109 [2019-11-20 11:08:48,125 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 11:08:48,126 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-20 11:08:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 11:08:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 11:08:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 11:08:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 11:08:48,134 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 11:08:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:48,134 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 11:08:48,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:08:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 11:08:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:08:48,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:48,136 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-20 11:08:48,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:48,340 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-20 11:08:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 11:08:48,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:48,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1375556017] [2019-11-20 11:08:48,342 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-20 11:08:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:48,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:08:48,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:48,587 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-20 11:08:48,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:48,621 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-20 11:08:48,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375556017] [2019-11-20 11:08:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:48,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:08:48,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668985234] [2019-11-20 11:08:48,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:08:48,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:08:48,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:08:48,624 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 11:08:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:49,041 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 11:08:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:08:49,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 11:08:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:49,044 INFO L225 Difference]: With dead ends: 135 [2019-11-20 11:08:49,044 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 11:08:49,045 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-20 11:08:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 11:08:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 11:08:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 11:08:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 11:08:49,049 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 11:08:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:49,050 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 11:08:49,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:08:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 11:08:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:08:49,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:49,051 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-20 11:08:49,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:49,256 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-20 11:08:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 11:08:49,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:49,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1804279869] [2019-11-20 11:08:49,259 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-20 11:08:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:49,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:08:49,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:49,524 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-20 11:08:49,524 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:49,615 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-20 11:08:49,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804279869] [2019-11-20 11:08:49,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:49,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 11:08:49,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993626813] [2019-11-20 11:08:49,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 11:08:49,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 11:08:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:08:49,618 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 11:08:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:50,622 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 11:08:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:08:50,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 11:08:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:50,624 INFO L225 Difference]: With dead ends: 104 [2019-11-20 11:08:50,624 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 11:08:50,624 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-20 11:08:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 11:08:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 11:08:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 11:08:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 11:08:50,628 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 11:08:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:50,628 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 11:08:50,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 11:08:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 11:08:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:08:50,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:50,629 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-20 11:08:50,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:50,831 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-20 11:08:50,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 11:08:50,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:50,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [480285174] [2019-11-20 11:08:50,833 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-20 11:08:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:51,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:08:51,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:51,045 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-20 11:08:51,046 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:51,058 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-20 11:08:51,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [480285174] [2019-11-20 11:08:51,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:51,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:08:51,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191321633] [2019-11-20 11:08:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:51,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:51,059 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 11:08:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:51,098 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 11:08:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:51,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 11:08:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:51,104 INFO L225 Difference]: With dead ends: 112 [2019-11-20 11:08:51,105 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 11:08:51,105 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-20 11:08:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 11:08:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 11:08:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 11:08:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 11:08:51,110 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 11:08:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:51,110 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 11:08:51,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 11:08:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:08:51,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:51,111 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-20 11:08:51,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:51,314 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-20 11:08:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 11:08:51,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:51,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1091743688] [2019-11-20 11:08:51,315 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-20 11:08:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:51,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:08:51,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:51,530 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-20 11:08:51,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:51,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:51,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:51,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:08:51,559 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-20 11:08:51,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:51,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:51,572 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-20 11:08:51,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 11:08:51,599 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-20 11:08:51,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:51,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:51,605 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-20 11:08:51,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 11:08:51,617 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-20 11:08:51,618 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:51,634 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-20 11:08:51,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1091743688] [2019-11-20 11:08:51,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:51,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:08:51,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860929299] [2019-11-20 11:08:51,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:08:51,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:08:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:08:51,638 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 11:08:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:52,040 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 11:08:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:08:52,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 11:08:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:52,042 INFO L225 Difference]: With dead ends: 114 [2019-11-20 11:08:52,042 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 11:08:52,043 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-20 11:08:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 11:08:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 11:08:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 11:08:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 11:08:52,048 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 11:08:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:52,048 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 11:08:52,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:08:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 11:08:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:08:52,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:52,050 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-20 11:08:52,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:52,252 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-20 11:08:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 11:08:52,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:52,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [927618009] [2019-11-20 11:08:52,254 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-20 11:08:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:52,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 11:08:52,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:52,484 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-20 11:08:52,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:52,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:08:52,510 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-20 11:08:52,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:52,530 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-20 11:08:52,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:52,542 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-20 11:08:52,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 11:08:52,588 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-20 11:08:52,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:52,619 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-20 11:08:52,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:52,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:52,626 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-20 11:08:52,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-20 11:08:52,647 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-20 11:08:52,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:52,986 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-20 11:08:52,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [927618009] [2019-11-20 11:08:52,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:52,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 11:08:52,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595757852] [2019-11-20 11:08:52,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:08:52,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:08:52,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:08:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:08:52,988 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 11:08:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:54,636 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 11:08:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:08:54,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 11:08:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:54,638 INFO L225 Difference]: With dead ends: 113 [2019-11-20 11:08:54,638 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 11:08:54,639 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-20 11:08:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 11:08:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 11:08:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 11:08:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 11:08:54,643 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 11:08:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:54,644 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 11:08:54,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:08:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 11:08:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:08:54,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:54,645 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-20 11:08:54,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:08:54,846 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-20 11:08:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 11:08:54,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:08:54,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [427228196] [2019-11-20 11:08:54,847 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-20 11:08:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:55,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:08:55,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:55,097 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-20 11:08:55,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:55,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:55,119 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-20 11:08:55,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:55,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:55,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:08:55,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:08:55,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:08:55,186 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-20 11:08:55,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:55,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:55,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:55,211 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-20 11:08:55,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:08:55,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:08:55,226 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-20 11:08:55,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-20 11:08:55,251 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-20 11:08:55,251 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:08:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:08:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:59,688 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 11:08:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:02,218 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 11:09:02,370 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-20 11:09:02,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427228196] [2019-11-20 11:09:02,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:02,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 11:09:02,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794309002] [2019-11-20 11:09:02,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:09:02,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:09:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:09:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 11:09:02,374 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 11:09:16,775 WARN L191 SmtUtils]: Spent 8.20 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 11:09:23,320 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-20 11:09:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:48,690 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-20 11:09:48,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:09:48,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 11:09:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:48,692 INFO L225 Difference]: With dead ends: 129 [2019-11-20 11:09:48,692 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 11:09:48,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=56, Invalid=127, Unknown=3, NotChecked=24, Total=210 [2019-11-20 11:09:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 11:09:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-20 11:09:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 11:09:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 11:09:48,698 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 11:09:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:48,699 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 11:09:48,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:09:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 11:09:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 11:09:48,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:48,700 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-20 11:09:48,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:09:48,904 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 11:09:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 11:09:48,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:09:48,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1632735087] [2019-11-20 11:09:48,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:09:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:49,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:09:49,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:49,118 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-20 11:09:49,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:49,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 11:09:49,141 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-20 11:09:49,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:09:49,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:49,204 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-20 11:09:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:49,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:49,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 11:09:49,215 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-20 11:09:49,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:49,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:49,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 11:09:49,221 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-20 11:09:49,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1632735087] [2019-11-20 11:09:49,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:49,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:09:49,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575696110] [2019-11-20 11:09:49,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:09:49,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:09:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:49,223 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 11:09:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:49,514 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 11:09:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:09:49,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 11:09:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:49,516 INFO L225 Difference]: With dead ends: 112 [2019-11-20 11:09:49,516 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 11:09:49,516 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-20 11:09:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 11:09:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 11:09:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 11:09:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 11:09:49,521 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 11:09:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:49,521 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 11:09:49,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:09:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 11:09:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 11:09:49,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:49,523 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-20 11:09:49,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:09:49,726 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-20 11:09:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 11:09:49,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:09:49,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1566409874] [2019-11-20 11:09:49,728 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-20 11:09:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:49,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:09:49,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:50,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-20 11:09:50,036 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:09:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:50,166 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-20 11:09:50,167 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-20 11:09:50,173 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-20 11:09:50,173 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-20 11:09:50,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:50,204 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-20 11:09:50,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 11:09:50,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:50,334 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-20 11:09:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,336 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-20 11:09:50,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:50,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,389 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-20 11:09:50,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 11:09:50,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:50,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:51,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:51,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:51,287 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-20 11:09:51,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1566409874] [2019-11-20 11:09:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 11:09:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429141508] [2019-11-20 11:09:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:09:51,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:09:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:09:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:09:51,289 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 11:09:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:51,822 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 11:09:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:09:51,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 11:09:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:51,824 INFO L225 Difference]: With dead ends: 106 [2019-11-20 11:09:51,824 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 11:09:51,825 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-20 11:09:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 11:09:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 11:09:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 11:09:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 11:09:51,829 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 11:09:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:51,829 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 11:09:51,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:09:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 11:09:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 11:09:51,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:51,830 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-20 11:09:52,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:09:52,035 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-20 11:09:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 11:09:52,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:09:52,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [139452314] [2019-11-20 11:09:52,036 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-20 11:09:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:52,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 11:09:52,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:52,304 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-20 11:09:52,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,318 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-20 11:09:52,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:09:52,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,383 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-20 11:09:52,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,403 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-20 11:09:52,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,421 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 11:09:52,421 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-20 11:09:52,422 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 11:09:52,534 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 11:09:52,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,547 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-20 11:09:52,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:52,596 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-20 11:09:52,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:52,636 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-20 11:09:52,636 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-20 11:09:52,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2019-11-20 11:09:52,649 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-20 11:09:52,650 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:09:52,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:52,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:52,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:56,511 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 11:09:56,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:57,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:57,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:57,087 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-20 11:09:57,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:57,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:57,113 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-20 11:09:57,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 11:09:57,483 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-20 11:09:57,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [139452314] [2019-11-20 11:09:57,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:57,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-20 11:09:57,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365794229] [2019-11-20 11:09:57,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:09:57,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:09:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:09:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-20 11:09:57,485 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-20 11:10:01,786 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)) (= (_ bv0 32) c_append_~pointerToList.offset) (exists ((|append_#t~malloc12.base| (_ BitVec 32))) (= (bvadd (select |c_#length| |append_#t~malloc12.base|) (_ bv4294967288 32)) (_ bv0 32))) (= (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-20 11:10:05,948 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-20 11:10:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:37,232 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-11-20 11:10:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:10:37,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 11:10:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:37,234 INFO L225 Difference]: With dead ends: 126 [2019-11-20 11:10:37,235 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 11:10:37,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=56, Invalid=221, Unknown=3, NotChecked=62, Total=342 [2019-11-20 11:10:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 11:10:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-11-20 11:10:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 11:10:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-20 11:10:37,242 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 22 [2019-11-20 11:10:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:37,242 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-20 11:10:37,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:10:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-20 11:10:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 11:10:37,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:10:37,260 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-20 11:10:37,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:10:37,461 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-20 11:10:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:10:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-20 11:10:37,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:10:37,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [539421521] [2019-11-20 11:10:37,465 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-20 11:10:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:37,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 11:10:37,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:10:37,710 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-20 11:10:37,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:37,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:37,722 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-20 11:10:37,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:37,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:37,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:10:37,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:10:37,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:37,854 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-20 11:10:37,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:37,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:37,874 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-20 11:10:37,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:37,900 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 11:10:37,901 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-20 11:10:37,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 11:10:37,977 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-20 11:10:37,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:37,991 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-20 11:10:37,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:38,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,034 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-20 11:10:38,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:38,069 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 11:10:38,070 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-20 11:10:38,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-20 11:10:38,111 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-20 11:10:38,111 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:10:38,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,674 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-20 11:10:38,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:38,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,698 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-20 11:10:38,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:38,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,714 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-20 11:10:38,715 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:10:38,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:10:38,769 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-20 11:10:38,769 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-20 11:10:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:38,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:10:38,954 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 11:10:38,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 11:10:39,811 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 11:10:39,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:10:39,831 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:10:39,836 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:10:39,840 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:10:39,868 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 11:10:40,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:40,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:40,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:40,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-20 11:10:40,163 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 11:10:40,171 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-20 11:10:40,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:10:40,372 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-20 11:10:40,379 INFO L168 Benchmark]: Toolchain (without parser) took 126086.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 134.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:10:40,380 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:10:40,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:10:40,380 INFO L168 Benchmark]: Boogie Preprocessor took 78.38 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-20 11:10:40,381 INFO L168 Benchmark]: RCFGBuilder took 1008.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:10:40,381 INFO L168 Benchmark]: TraceAbstraction took 124312.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.6 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:10:40,383 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.38 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 1008.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 124312.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.6 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...