./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 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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-264dba8 [2019-11-21 14:17:56,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 14:17:56,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 14:17:56,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 14:17:56,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 14:17:56,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 14:17:56,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 14:17:56,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 14:17:56,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 14:17:56,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 14:17:56,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 14:17:56,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 14:17:56,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 14:17:56,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 14:17:56,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 14:17:56,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 14:17:56,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 14:17:56,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 14:17:56,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 14:17:56,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 14:17:56,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 14:17:56,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 14:17:56,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 14:17:56,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 14:17:56,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 14:17:56,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 14:17:56,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 14:17:56,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 14:17:56,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 14:17:56,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 14:17:56,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 14:17:56,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 14:17:56,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 14:17:56,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 14:17:56,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 14:17:56,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 14:17:56,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 14:17:56,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 14:17:56,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 14:17:56,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 14:17:56,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 14:17:56,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 14:17:56,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 14:17:56,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 14:17:56,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 14:17:56,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 14:17:56,189 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 14:17:56,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 14:17:56,189 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 14:17:56,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 14:17:56,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 14:17:56,190 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 14:17:56,190 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 14:17:56,190 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 14:17:56,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 14:17:56,190 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 14:17:56,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 14:17:56,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 14:17:56,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 14:17:56,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 14:17:56,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 14:17:56,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 14:17:56,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:17:56,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 14:17:56,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 14:17:56,193 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 14:17:56,193 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 14:17:56,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 14:17:56,193 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-21 14:17:56,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 14:17:56,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 14:17:56,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 14:17:56,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 14:17:56,591 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 14:17:56,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 14:17:56,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8659b88/f5fdfb62a3e14abe9c05b1c8fae24e4c/FLAG203513325 [2019-11-21 14:17:57,188 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 14:17:57,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 14:17:57,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8659b88/f5fdfb62a3e14abe9c05b1c8fae24e4c/FLAG203513325 [2019-11-21 14:17:57,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8659b88/f5fdfb62a3e14abe9c05b1c8fae24e4c [2019-11-21 14:17:57,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 14:17:57,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 14:17:57,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 14:17:57,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 14:17:57,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 14:17:57,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:17:57" (1/1) ... [2019-11-21 14:17:57,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190158d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:57, skipping insertion in model container [2019-11-21 14:17:57,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:17:57" (1/1) ... [2019-11-21 14:17:57,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 14:17:57,553 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 14:17:57,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:17:57,981 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 14:17:58,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:17:58,125 INFO L205 MainTranslator]: Completed translation [2019-11-21 14:17:58,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58 WrapperNode [2019-11-21 14:17:58,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 14:17:58,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 14:17:58,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 14:17:58,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 14:17:58,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... [2019-11-21 14:17:58,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 14:17:58,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 14:17:58,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 14:17:58,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 14:17:58,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:17:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 14:17:58,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 14:17:58,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 14:17:58,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 14:17:58,267 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 14:17:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 14:17:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 14:17:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 14:17:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 14:17:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 14:17:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 14:17:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 14:17:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 14:17:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 14:17:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 14:17:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 14:17:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 14:17:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 14:17:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 14:17:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 14:17:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 14:17:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 14:17:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 14:17:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 14:17:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 14:17:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 14:17:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 14:17:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 14:17:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 14:17:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 14:17:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 14:17:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 14:17:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 14:17:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 14:17:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 14:17:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 14:17:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 14:17:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 14:17:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 14:17:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 14:17:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 14:17:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 14:17:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 14:17:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 14:17:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 14:17:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 14:17:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 14:17:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 14:17:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 14:17:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 14:17:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 14:17:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 14:17:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 14:17:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 14:17:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 14:17:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 14:17:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 14:17:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 14:17:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 14:17:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 14:17:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 14:17:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 14:17:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 14:17:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 14:17:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 14:17:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 14:17:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 14:17:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 14:17:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 14:17:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 14:17:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 14:17:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 14:17:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 14:17:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 14:17:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 14:17:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 14:17:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 14:17:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 14:17:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 14:17:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 14:17:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 14:17:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 14:17:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 14:17:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 14:17:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 14:17:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 14:17:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 14:17:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 14:17:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 14:17:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 14:17:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 14:17:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 14:17:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 14:17:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 14:17:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 14:17:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 14:17:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 14:17:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 14:17:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 14:17:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 14:17:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 14:17:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 14:17:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 14:17:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 14:17:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 14:17:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 14:17:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 14:17:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 14:17:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 14:17:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 14:17:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 14:17:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 14:17:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 14:17:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 14:17:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 14:17:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 14:17:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 14:17:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 14:17:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 14:17:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 14:17:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 14:17:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 14:17:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 14:17:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 14:17:59,127 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 14:17:59,127 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 14:17:59,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:17:59 BoogieIcfgContainer [2019-11-21 14:17:59,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 14:17:59,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 14:17:59,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 14:17:59,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 14:17:59,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:17:57" (1/3) ... [2019-11-21 14:17:59,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f5e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:17:59, skipping insertion in model container [2019-11-21 14:17:59,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:17:58" (2/3) ... [2019-11-21 14:17:59,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f5e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:17:59, skipping insertion in model container [2019-11-21 14:17:59,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:17:59" (3/3) ... [2019-11-21 14:17:59,138 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-21 14:17:59,149 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 14:17:59,157 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 14:17:59,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 14:17:59,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 14:17:59,195 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 14:17:59,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 14:17:59,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 14:17:59,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 14:17:59,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 14:17:59,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 14:17:59,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 14:17:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 14:17:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 14:17:59,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:17:59,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:17:59,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:17:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:17:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 14:17:59,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:17:59,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [613686042] [2019-11-21 14:17:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:17:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:17:59,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 14:17:59,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:17:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:17:59,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:17:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:17:59,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [613686042] [2019-11-21 14:17:59,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:17:59,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 14:17:59,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247135247] [2019-11-21 14:17:59,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 14:17:59,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:17:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 14:17:59,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 14:17:59,543 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 14:17:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:17:59,567 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 14:17:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 14:17:59,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 14:17:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:17:59,580 INFO L225 Difference]: With dead ends: 110 [2019-11-21 14:17:59,581 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:17:59,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 14:17:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:17:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 14:17:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 14:17:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 14:17:59,632 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 14:17:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:17:59,633 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 14:17:59,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 14:17:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 14:17:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 14:17:59,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:17:59,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:17:59,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:17:59,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:17:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:17:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 14:17:59,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:17:59,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2030463225] [2019-11-21 14:17:59,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:00,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:18:00,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:00,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-21 14:18:00,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:00,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:00,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:00,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:18:00,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:00,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-21 14:18:00,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:00,202 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 14:18:00,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:18:00,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 14:18:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:00,227 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:00,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-21 14:18:00,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030463225] [2019-11-21 14:18:00,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:00,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:18:00,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46942050] [2019-11-21 14:18:00,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:18:00,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:00,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:18:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:18:00,255 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 14:18:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:00,826 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 14:18:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:18:00,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 14:18:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:00,831 INFO L225 Difference]: With dead ends: 116 [2019-11-21 14:18:00,832 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 14:18:00,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 14:18:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 14:18:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 14:18:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 14:18:00,850 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 14:18:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:00,850 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 14:18:00,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:18:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 14:18:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 14:18:00,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:00,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:01,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:01,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 14:18:01,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:01,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [888683046] [2019-11-21 14:18:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:01,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 14:18:01,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:01,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:01,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:01,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:01,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:01,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:01,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:01,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:01,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:18:01,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:18:01,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 14:18:01,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:01,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:01,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:18:01,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:18:01,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:01,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:01,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:18:01,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-21 14:18:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:01,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:01,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:18:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:01,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [888683046] [2019-11-21 14:18:01,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:01,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 14:18:01,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175732227] [2019-11-21 14:18:01,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 14:18:01,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 14:18:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 14:18:01,763 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 14:18:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:06,208 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 14:18:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:18:06,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 14:18:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:06,212 INFO L225 Difference]: With dead ends: 115 [2019-11-21 14:18:06,212 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 14:18:06,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-21 14:18:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 14:18:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 14:18:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 14:18:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 14:18:06,224 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 14:18:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:06,224 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 14:18:06,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 14:18:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 14:18:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:18:06,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:06,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:06,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:06,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 14:18:06,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:06,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1189605074] [2019-11-21 14:18:06,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:06,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:18:06,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:06,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:06,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:06,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:06,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:06,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:18:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:06,627 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:06,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189605074] [2019-11-21 14:18:06,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:06,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 14:18:06,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377407778] [2019-11-21 14:18:06,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:18:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:18:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:06,653 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 14:18:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:06,857 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 14:18:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:18:06,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:18:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:06,859 INFO L225 Difference]: With dead ends: 108 [2019-11-21 14:18:06,859 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 14:18:06,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 14:18:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 14:18:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 14:18:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 14:18:06,868 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 14:18:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:06,869 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 14:18:06,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:18:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 14:18:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:18:06,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:06,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:07,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:07,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 14:18:07,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:07,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [86413000] [2019-11-21 14:18:07,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:07,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:18:07,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:07,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:07,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:07,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:07,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:07,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:18:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:07,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:07,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [86413000] [2019-11-21 14:18:07,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:07,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 14:18:07,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623096831] [2019-11-21 14:18:07,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:18:07,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:18:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:07,310 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 14:18:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:07,716 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 14:18:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:18:07,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:18:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:07,718 INFO L225 Difference]: With dead ends: 107 [2019-11-21 14:18:07,718 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:18:07,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:18:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 14:18:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 14:18:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 14:18:07,728 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 14:18:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:07,729 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 14:18:07,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:18:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 14:18:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 14:18:07,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:07,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:07,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:07,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:07,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 14:18:07,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:07,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1616692743] [2019-11-21 14:18:07,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:08,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:18:08,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:08,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:08,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:08,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:08,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:08,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:18:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:08,161 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:08,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616692743] [2019-11-21 14:18:08,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:08,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 14:18:08,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312342855] [2019-11-21 14:18:08,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 14:18:08,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 14:18:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 14:18:08,173 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 14:18:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:08,408 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 14:18:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:18:08,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 14:18:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:08,410 INFO L225 Difference]: With dead ends: 105 [2019-11-21 14:18:08,410 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 14:18:08,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 14:18:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 14:18:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 14:18:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 14:18:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 14:18:08,422 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 14:18:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:08,423 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 14:18:08,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 14:18:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 14:18:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 14:18:08,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:08,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:08,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:08,631 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 14:18:08,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:08,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [640149660] [2019-11-21 14:18:08,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:08,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:18:08,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:08,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:08,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:08,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:08,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:08,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:18:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:08,858 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:08,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [640149660] [2019-11-21 14:18:08,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:08,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 14:18:08,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637202060] [2019-11-21 14:18:08,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:18:08,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:08,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:18:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:08,890 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 14:18:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:09,229 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 14:18:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:18:09,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 14:18:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:09,231 INFO L225 Difference]: With dead ends: 106 [2019-11-21 14:18:09,231 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 14:18:09,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 14:18:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 14:18:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 14:18:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 14:18:09,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 14:18:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:09,238 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 14:18:09,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:18:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 14:18:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 14:18:09,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:09,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:09,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:09,442 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 14:18:09,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:09,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [446529308] [2019-11-21 14:18:09,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:09,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 14:18:09,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:09,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:09,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:09,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:09,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:09,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:18:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:09,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:09,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [446529308] [2019-11-21 14:18:09,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:09,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 14:18:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404240878] [2019-11-21 14:18:09,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:18:09,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:18:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:09,717 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 14:18:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:10,295 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 14:18:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:18:10,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 14:18:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:10,297 INFO L225 Difference]: With dead ends: 135 [2019-11-21 14:18:10,298 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 14:18:10,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-21 14:18:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 14:18:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 14:18:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 14:18:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 14:18:10,305 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 14:18:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:10,305 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 14:18:10,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:18:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 14:18:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 14:18:10,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:10,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:10,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:10,509 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 14:18:10,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:10,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1354639326] [2019-11-21 14:18:10,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:10,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:18:10,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:10,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:10,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:10,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:10,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:10,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:18:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:10,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:10,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:18:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:10,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354639326] [2019-11-21 14:18:10,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:10,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 14:18:10,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147012999] [2019-11-21 14:18:10,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:18:10,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:18:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:10,836 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 14:18:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:11,506 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 14:18:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:18:11,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 14:18:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:11,513 INFO L225 Difference]: With dead ends: 109 [2019-11-21 14:18:11,513 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 14:18:11,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 14:18:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 14:18:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 14:18:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 14:18:11,524 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 14:18:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:11,524 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 14:18:11,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:18:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 14:18:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:18:11,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:11,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:11,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:11,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 14:18:11,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:11,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1419487593] [2019-11-21 14:18:11,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:11,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:18:11,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:11,975 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:12,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419487593] [2019-11-21 14:18:12,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:12,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:18:12,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4784078] [2019-11-21 14:18:12,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:18:12,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:18:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:18:12,026 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 14:18:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:12,522 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 14:18:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:18:12,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 14:18:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:12,524 INFO L225 Difference]: With dead ends: 135 [2019-11-21 14:18:12,524 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 14:18:12,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 14:18:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 14:18:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 14:18:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 14:18:12,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 14:18:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:12,531 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 14:18:12,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:18:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 14:18:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:18:12,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:12,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:12,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:12,742 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 14:18:12,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:12,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [560641438] [2019-11-21 14:18:12,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:12,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 14:18:12,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:13,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:13,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:18:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:13,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [560641438] [2019-11-21 14:18:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:13,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 14:18:13,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130191650] [2019-11-21 14:18:13,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 14:18:13,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:13,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 14:18:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 14:18:13,112 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 14:18:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:14,255 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 14:18:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:18:14,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 14:18:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:14,259 INFO L225 Difference]: With dead ends: 104 [2019-11-21 14:18:14,259 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 14:18:14,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-21 14:18:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 14:18:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 14:18:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 14:18:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 14:18:14,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 14:18:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:14,265 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 14:18:14,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 14:18:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 14:18:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:18:14,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:14,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:14,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:14,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 14:18:14,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:14,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [989084531] [2019-11-21 14:18:14,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:14,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:18:14,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:14,678 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:14,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989084531] [2019-11-21 14:18:14,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:14,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:18:14,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545564391] [2019-11-21 14:18:14,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:18:14,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:18:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:14,698 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 14:18:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:14,741 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 14:18:14,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:18:14,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 14:18:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:14,743 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:18:14,744 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 14:18:14,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:18:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 14:18:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 14:18:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:18:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 14:18:14,749 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 14:18:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:14,749 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 14:18:14,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:18:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 14:18:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:18:14,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:14,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:14,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:14,954 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 14:18:14,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:14,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [39181656] [2019-11-21 14:18:14,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 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:15,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:18:15,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:15,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:15,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:15,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:18:15,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:18:15,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:15,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 14:18:15,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 14:18:15,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:15,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:15,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 14:18:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:15,242 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:15,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39181656] [2019-11-21 14:18:15,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:15,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:18:15,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825845667] [2019-11-21 14:18:15,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:18:15,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:15,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:18:15,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:18:15,256 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 14:18:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:15,664 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-21 14:18:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:18:15,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 14:18:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:15,666 INFO L225 Difference]: With dead ends: 114 [2019-11-21 14:18:15,667 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 14:18:15,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-21 14:18:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 14:18:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-21 14:18:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:18:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-21 14:18:15,671 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-21 14:18:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:15,671 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-21 14:18:15,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:18:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-21 14:18:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:18:15,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:15,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:15,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:15,875 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 14:18:15,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:15,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [120661293] [2019-11-21 14:18:15,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:16,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 14:18:16,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:16,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:16,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:16,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:18:16,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:18:16,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:16,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:18:16,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:16,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-21 14:18:16,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-21 14:18:16,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:16,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-21 14:18:16,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:16,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:16,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-21 14:18:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:16,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:16,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120661293] [2019-11-21 14:18:16,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:16,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:18:16,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703707859] [2019-11-21 14:18:16,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:18:16,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:16,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:18:16,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:18:16,608 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-21 14:18:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:18,450 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 14:18:18,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 14:18:18,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 14:18:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:18,454 INFO L225 Difference]: With dead ends: 113 [2019-11-21 14:18:18,454 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 14:18:18,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-21 14:18:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 14:18:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-21 14:18:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:18:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-21 14:18:18,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-21 14:18:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:18,461 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-21 14:18:18,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:18:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-21 14:18:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:18:18,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:18,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:18,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:18,668 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 14:18:18,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:18,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1461674846] [2019-11-21 14:18:18,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:18,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 14:18:18,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:18,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:18,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:18,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:18,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:18:18,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:18,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:18,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:18,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:18:19,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:18:19,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 14:18:19,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:19,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:19,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:18:19,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 14:18:19,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:19,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:19,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:18:19,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-21 14:18:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:19,095 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:19,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:18:19,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:18:19,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:19,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:23,319 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 14:18:23,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:24,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-21 14:18:24,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461674846] [2019-11-21 14:18:24,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:24,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:18:24,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551093366] [2019-11-21 14:18:24,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:18:24,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:18:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 14:18:24,060 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-21 14:18:31,548 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-21 14:18:36,304 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-21 14:18:38,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_4 (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-21 14:18:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:58,958 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-11-21 14:18:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 14:18:58,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 14:18:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:58,960 INFO L225 Difference]: With dead ends: 127 [2019-11-21 14:18:58,960 INFO L226 Difference]: Without dead ends: 127 [2019-11-21 14:18:58,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=54, Invalid=129, Unknown=3, NotChecked=24, Total=210 [2019-11-21 14:18:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-21 14:18:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-21 14:18:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 14:18:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-21 14:18:58,966 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-21 14:18:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:58,966 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-21 14:18:58,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:18:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-21 14:18:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:18:58,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:58,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:18:59,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:59,169 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:18:59,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:18:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 14:18:59,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:18:59,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1776630255] [2019-11-21 14:18:59,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:18:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:18:59,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:18:59,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:18:59,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 14:18:59,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:59,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 14:18:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:59,415 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:18:59,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:59,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-21 14:18:59,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:18:59,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:59,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 14:18:59,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-21 14:18:59,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:18:59,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:18:59,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 14:18:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:18:59,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1776630255] [2019-11-21 14:18:59,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:18:59,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:18:59,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280879808] [2019-11-21 14:18:59,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:18:59,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:18:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:18:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:18:59,516 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-21 14:18:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:18:59,826 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 14:18:59,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:18:59,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 14:18:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:18:59,829 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:18:59,829 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 14:18:59,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:18:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 14:18:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-21 14:18:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 14:18:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-21 14:18:59,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-21 14:18:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:18:59,834 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-21 14:18:59,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:18:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-21 14:18:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:18:59,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:18:59,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:19:00,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:19:00,038 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:19:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:19:00,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 14:19:00,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:19:00,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [635317807] [2019-11-21 14:19:00,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:19:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:19:00,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:19:00,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:19:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:19:00,306 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:19:00,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:19:00,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-21 14:19:00,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:00,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-21 14:19:00,439 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:00,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:00,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 14:19:00,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 14:19:00,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:00,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-21 14:19:00,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:00,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:00,628 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:00,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:00,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:00,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:00,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 14:19:00,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:01,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:01,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:01,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:01,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:19:01,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [635317807] [2019-11-21 14:19:01,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:19:01,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:19:01,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208232982] [2019-11-21 14:19:01,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:19:01,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:19:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:19:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:19:01,560 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-21 14:19:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:19:02,022 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-21 14:19:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:19:02,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 14:19:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:19:02,025 INFO L225 Difference]: With dead ends: 106 [2019-11-21 14:19:02,025 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 14:19:02,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 14:19:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 14:19:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-21 14:19:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 14:19:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-21 14:19:02,029 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-21 14:19:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:19:02,029 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-21 14:19:02,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:19:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-21 14:19:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:19:02,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:19:02,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:19:02,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:19:02,235 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:19:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:19:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 14:19:02,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:19:02,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [758557362] [2019-11-21 14:19:02,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:19:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:19:02,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 14:19:02,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:19:02,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:19:02,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:19:02,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:19:02,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 14:19:02,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 14:19:02,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,604 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 14:19:02,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:02,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 14:19:02,755 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 14:19:02,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 14:19:02,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:02,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-21 14:19:02,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:02,876 INFO L567 ElimStorePlain]: treesize reduction 18, result has 58.1 percent of original size [2019-11-21 14:19:02,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:02,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:02,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:25 [2019-11-21 14:19:02,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:02,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:02,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:19:03,004 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:19:03,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:19:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:19:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:19:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:03,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:06,922 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 14:19:06,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:19:07,643 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 14:19:07,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:19:07,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:07,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 14:19:07,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:19:07,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:19:07,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:19:07,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 14:19:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:19:08,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [758557362] [2019-11-21 14:19:08,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:19:08,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 14:19:08,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790323360] [2019-11-21 14:19:08,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 14:19:08,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:19:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 14:19:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-21 14:19:08,337 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 16 states. [2019-11-21 14:19:19,674 WARN L192 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-21 14:19:23,913 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10))))) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-21 14:19:36,837 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-21 14:19:45,193 WARN L192 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-21 14:20:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:05,581 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-21 14:20:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-21 14:20:05,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-21 14:20:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:05,585 INFO L225 Difference]: With dead ends: 130 [2019-11-21 14:20:05,585 INFO L226 Difference]: Without dead ends: 130 [2019-11-21 14:20:05,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=87, Invalid=335, Unknown=2, NotChecked=38, Total=462 [2019-11-21 14:20:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-21 14:20:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2019-11-21 14:20:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 14:20:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-11-21 14:20:05,595 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 22 [2019-11-21 14:20:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:05,596 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-11-21 14:20:05,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 14:20:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-11-21 14:20:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 14:20:05,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:05,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:20:05,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:05,802 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-21 14:20:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 14:20:05,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:05,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [746100366] [2019-11-21 14:20:05,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:06,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 14:20:06,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:06,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:20:06,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:20:06,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:20:06,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 14:20:06,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 14:20:06,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,226 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 14:20:06,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:20:06,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 14:20:06,334 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 14:20:06,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 14:20:06,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:06,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-21 14:20:06,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:06,460 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 14:20:06,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 14:20:06,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 14:20:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:20:06,531 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:06,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:20:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:20:07,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:07,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-21 14:20:07,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:07,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:07,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2019-11-21 14:20:07,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:07,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:07,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2019-11-21 14:20:07,222 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:07,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:07,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 14:20:07,302 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 14:20:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:20:07,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:20:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:07,502 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 14:20:07,509 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 14:20:08,969 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 14:20:08,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:20:08,977 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:20:08,982 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:20:08,986 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:20:09,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:20:09,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:09,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:09,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:20:09,032 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-21 14:20:09,064 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-21 14:20:09,075 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 14:20:09,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:09,280 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 14:20:09,287 INFO L168 Benchmark]: Toolchain (without parser) took 131798.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 150.3 MB. Max. memory is 11.5 GB. [2019-11-21 14:20:09,287 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:20:09,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:20:09,288 INFO L168 Benchmark]: Boogie Preprocessor took 79.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 14:20:09,288 INFO L168 Benchmark]: RCFGBuilder took 922.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:20:09,289 INFO L168 Benchmark]: TraceAbstraction took 130155.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2019-11-21 14:20:09,291 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.22 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 636.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 922.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130155.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.8 MB). Peak memory consumption was 95.8 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...