./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f 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-bftpd/bftpd_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b33005346e6b80bc2289c235b2b7a5c7f83b2de ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-701f399 [2019-11-22 10:11:27,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:11:27,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:11:27,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:11:27,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:11:27,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:11:27,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:11:27,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:11:27,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:11:27,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:11:27,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:11:27,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:11:27,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:11:27,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:11:27,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:11:27,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:11:27,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:11:27,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:11:27,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:11:27,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:11:27,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:11:27,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:11:27,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:11:27,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:11:27,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:11:27,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:11:27,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:11:27,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:11:27,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:11:27,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:11:27,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:11:27,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:11:27,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:11:27,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:11:27,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:11:27,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:11:27,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:11:27,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:11:27,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:11:27,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:11:27,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:11:27,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 10:11:27,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:11:27,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:11:27,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:11:27,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:11:27,238 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:11:27,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:11:27,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:11:27,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:11:27,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:11:27,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:11:27,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:11:27,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:11:27,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:11:27,240 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 10:11:27,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:11:27,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:11:27,241 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:11:27,241 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:11:27,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:11:27,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:11:27,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:11:27,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:11:27,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:11:27,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:11:27,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:11:27,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:11:27,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:11:27,243 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:11:27,243 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:11:27,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:11:27,244 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b33005346e6b80bc2289c235b2b7a5c7f83b2de [2019-11-22 10:11:27,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:11:27,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:11:27,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:11:27,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:11:27,572 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:11:27,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2019-11-22 10:11:27,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d3f494d/838bc67aac6149d3ab0166ea77fd5e61/FLAG015f33a05 [2019-11-22 10:11:28,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:11:28,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2019-11-22 10:11:28,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d3f494d/838bc67aac6149d3ab0166ea77fd5e61/FLAG015f33a05 [2019-11-22 10:11:28,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d3f494d/838bc67aac6149d3ab0166ea77fd5e61 [2019-11-22 10:11:28,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:11:28,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:11:28,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:11:28,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:11:28,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:11:28,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:28" (1/1) ... [2019-11-22 10:11:28,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f639f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28, skipping insertion in model container [2019-11-22 10:11:28,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:28" (1/1) ... [2019-11-22 10:11:28,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:11:28,561 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:11:29,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:11:29,074 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:11:29,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:11:29,238 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:11:29,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29 WrapperNode [2019-11-22 10:11:29,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:11:29,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:11:29,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:11:29,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:11:29,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (1/1) ... [2019-11-22 10:11:29,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:11:29,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:11:29,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:11:29,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:11:29,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (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-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:11:29,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:11:29,424 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 10:11:29,424 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 10:11:29,424 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 10:11:29,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:11:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:11:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:11:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:11:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:11:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:11:29,429 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:11:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:11:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 10:11:29,432 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:11:29,433 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:11:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:11:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:11:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:11:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:11:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 10:11:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 10:11:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 10:11:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 10:11:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 10:11:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 10:11:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 10:11:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:11:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 10:11:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 10:11:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:11:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:11:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:11:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 10:11:30,273 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:11:30,273 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 10:11:30,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:30 BoogieIcfgContainer [2019-11-22 10:11:30,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:11:30,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:11:30,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:11:30,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:11:30,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:11:28" (1/3) ... [2019-11-22 10:11:30,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd412d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:30, skipping insertion in model container [2019-11-22 10:11:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:29" (2/3) ... [2019-11-22 10:11:30,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd412d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:30, skipping insertion in model container [2019-11-22 10:11:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:30" (3/3) ... [2019-11-22 10:11:30,283 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2019-11-22 10:11:30,292 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:11:30,299 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-22 10:11:30,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-22 10:11:30,330 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:11:30,330 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:11:30,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:11:30,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:11:30,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:11:30,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:11:30,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:11:30,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:11:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-22 10:11:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:11:30,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:30,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:30,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -317410196, now seen corresponding path program 1 times [2019-11-22 10:11:30,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:30,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [399311006] [2019-11-22 10:11:30,382 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-22 10:11:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:30,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:11:30,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:31,222 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:11:31,224 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:11:31,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 10:11:31,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:31,319 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 10:11:31,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:31,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:31,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 10:11:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:11:31,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:31,403 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-22 10:11:31,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399311006] [2019-11-22 10:11:31,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:31,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:11:31,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324233432] [2019-11-22 10:11:31,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:11:31,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:11:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:11:31,430 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2019-11-22 10:11:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:11:31,608 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-11-22 10:11:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:11:31,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 10:11:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:11:31,624 INFO L225 Difference]: With dead ends: 97 [2019-11-22 10:11:31,624 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 10:11:31,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:11:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 10:11:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-11-22 10:11:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-22 10:11:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2019-11-22 10:11:31,689 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 9 [2019-11-22 10:11:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:11:31,689 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2019-11-22 10:11:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:11:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2019-11-22 10:11:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:11:31,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:31,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:31,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:11:31,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -317410195, now seen corresponding path program 1 times [2019-11-22 10:11:31,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:31,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1012820526] [2019-11-22 10:11:31,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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-22 10:11:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:32,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:11:32,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:32,667 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:11:32,668 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:11:32,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:11:32,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:32,812 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 10:11:32,812 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 10:11:32,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:11:32,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 10:11:32,861 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-22 10:11:32,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:33,091 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-22 10:11:33,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012820526] [2019-11-22 10:11:33,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:33,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:11:33,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374843604] [2019-11-22 10:11:33,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:11:33,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:33,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:11:33,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:11:33,096 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 6 states. [2019-11-22 10:11:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:11:33,687 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2019-11-22 10:11:33,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:11:33,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 10:11:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:11:33,690 INFO L225 Difference]: With dead ends: 174 [2019-11-22 10:11:33,690 INFO L226 Difference]: Without dead ends: 174 [2019-11-22 10:11:33,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:11:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-22 10:11:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2019-11-22 10:11:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-22 10:11:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2019-11-22 10:11:33,721 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 9 [2019-11-22 10:11:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:11:33,721 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2019-11-22 10:11:33,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:11:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2019-11-22 10:11:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:11:33,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:33,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:33,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:11:33,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1249781436, now seen corresponding path program 1 times [2019-11-22 10:11:33,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:33,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [989437985] [2019-11-22 10:11:33,930 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-22 10:11:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:34,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 10:11:34,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:34,955 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 10:11:34,957 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 10:11:34,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 360 treesize of output 456 [2019-11-22 10:11:34,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:34,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:35,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:36,349 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 234 DAG size of output: 65 [2019-11-22 10:11:36,352 INFO L567 ElimStorePlain]: treesize reduction 14841, result has 1.1 percent of original size [2019-11-22 10:11:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:36,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:143, output treesize:162 [2019-11-22 10:11:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:36,876 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-11-22 10:11:36,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 46 [2019-11-22 10:11:36,914 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-22 10:11:37,042 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-22 10:11:37,043 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.2 percent of original size [2019-11-22 10:11:37,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:37,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:68 [2019-11-22 10:11:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:11:37,078 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:37,565 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-22 10:11:37,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989437985] [2019-11-22 10:11:37,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:37,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:11:37,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501484694] [2019-11-22 10:11:37,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:11:37,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:11:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:11:37,567 INFO L87 Difference]: Start difference. First operand 142 states and 205 transitions. Second operand 8 states. [2019-11-22 10:11:37,827 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-11-22 10:11:38,048 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-22 10:11:38,415 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-22 10:11:39,057 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-11-22 10:11:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:11:39,757 INFO L93 Difference]: Finished difference Result 293 states and 426 transitions. [2019-11-22 10:11:39,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:11:39,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 10:11:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:11:39,763 INFO L225 Difference]: With dead ends: 293 [2019-11-22 10:11:39,763 INFO L226 Difference]: Without dead ends: 293 [2019-11-22 10:11:39,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 10:11:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-22 10:11:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 215. [2019-11-22 10:11:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-22 10:11:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 327 transitions. [2019-11-22 10:11:39,800 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 327 transitions. Word has length 10 [2019-11-22 10:11:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:11:39,801 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 327 transitions. [2019-11-22 10:11:39,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:11:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 327 transitions. [2019-11-22 10:11:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 10:11:39,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:39,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:40,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:11:40,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash -88518740, now seen corresponding path program 1 times [2019-11-22 10:11:40,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:40,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [179821739] [2019-11-22 10:11:40,008 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-22 10:11:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:40,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:11:40,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:40,519 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_72|]} [2019-11-22 10:11:40,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:40,898 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 10:11:40,899 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 10:11:40,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 10:11:40,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:41,155 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 10:11:41,156 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 10:11:41,245 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:41,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 280 treesize of output 302 [2019-11-22 10:11:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:41,924 WARN L192 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 71 [2019-11-22 10:11:41,925 INFO L567 ElimStorePlain]: treesize reduction 3047, result has 4.8 percent of original size [2019-11-22 10:11:41,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:41,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 10:11:41,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:41,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:42,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:11:42,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2019-11-22 10:11:42,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:11:42,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:42,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 10:11:42,184 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:42,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 126 [2019-11-22 10:11:42,227 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,236 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,237 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,246 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,246 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:42,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2019-11-22 10:11:42,272 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,282 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,282 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,294 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:11:42,315 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,323 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,324 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:11:42,331 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:42,812 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:11:42,812 INFO L567 ElimStorePlain]: treesize reduction 337, result has 47.9 percent of original size [2019-11-22 10:11:42,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 10:11:42,814 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1515, output treesize:310 [2019-11-22 10:11:43,121 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 10:11:43,386 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-22 10:11:43,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:11:43,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 59 [2019-11-22 10:11:43,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:43,587 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-22 10:11:43,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:43,607 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 51 treesize of output 43 [2019-11-22 10:11:43,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:43,810 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 10:11:43,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:43,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 59 [2019-11-22 10:11:43,821 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:43,965 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 10:11:43,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:43,978 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 84 treesize of output 76 [2019-11-22 10:11:43,978 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:44,115 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 10:11:44,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:44,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2019-11-22 10:11:44,127 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:44,319 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 10:11:44,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:44,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 45 [2019-11-22 10:11:44,331 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:44,488 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-22 10:11:44,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:44,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 10:11:44,492 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:243, output treesize:121 [2019-11-22 10:11:44,639 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-22 10:11:44,640 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:44,880 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 10:11:45,030 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 10:11:45,201 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-22 10:11:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179821739] [2019-11-22 10:11:45,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:45,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 10:11:45,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495970732] [2019-11-22 10:11:45,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 10:11:45,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 10:11:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:11:45,203 INFO L87 Difference]: Start difference. First operand 215 states and 327 transitions. Second operand 9 states. [2019-11-22 10:11:45,631 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2019-11-22 10:11:46,134 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2019-11-22 10:11:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:11:47,941 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2019-11-22 10:11:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 10:11:47,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 10:11:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:11:47,948 INFO L225 Difference]: With dead ends: 397 [2019-11-22 10:11:47,948 INFO L226 Difference]: Without dead ends: 397 [2019-11-22 10:11:47,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 10:11:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-22 10:11:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 328. [2019-11-22 10:11:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 10:11:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-11-22 10:11:47,981 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 11 [2019-11-22 10:11:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:11:47,982 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-11-22 10:11:47,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 10:11:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-11-22 10:11:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 10:11:47,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:47,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:48,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:11:48,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1550886470, now seen corresponding path program 1 times [2019-11-22 10:11:48,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:48,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [92427444] [2019-11-22 10:11:48,190 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-22 10:11:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:48,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 10:11:48,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:48,929 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2019-11-22 10:11:48,930 INFO L343 Elim1Store]: treesize reduction 355, result has 16.1 percent of original size [2019-11-22 10:11:48,930 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 8 case distinctions, treesize of input 193 treesize of output 235 [2019-11-22 10:11:48,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:48,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:48,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:49,147 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-11-22 10:11:49,148 INFO L567 ElimStorePlain]: treesize reduction 384, result has 18.5 percent of original size [2019-11-22 10:11:49,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,151 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 1 xjuncts. [2019-11-22 10:11:49,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:87 [2019-11-22 10:11:49,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:11:49,541 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-11-22 10:11:49,641 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-22 10:11:49,641 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:49,915 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-22 10:11:49,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92427444] [2019-11-22 10:11:49,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:49,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:11:49,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632377732] [2019-11-22 10:11:49,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:11:49,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:11:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:11:49,919 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 10 states. [2019-11-22 10:11:53,962 WARN L192 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-11-22 10:11:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:11:54,765 INFO L93 Difference]: Finished difference Result 435 states and 652 transitions. [2019-11-22 10:11:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 10:11:54,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 10:11:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:11:54,771 INFO L225 Difference]: With dead ends: 435 [2019-11-22 10:11:54,771 INFO L226 Difference]: Without dead ends: 435 [2019-11-22 10:11:54,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:11:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-22 10:11:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 361. [2019-11-22 10:11:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-22 10:11:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 566 transitions. [2019-11-22 10:11:54,800 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 566 transitions. Word has length 12 [2019-11-22 10:11:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:11:54,801 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 566 transitions. [2019-11-22 10:11:54,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:11:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 566 transitions. [2019-11-22 10:11:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 10:11:54,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:11:54,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:11:55,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:11:55,006 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:11:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:11:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 832840430, now seen corresponding path program 1 times [2019-11-22 10:11:55,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:11:55,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [718371950] [2019-11-22 10:11:55,008 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-22 10:11:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:11:55,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 10:11:55,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:11:55,436 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_88|]} [2019-11-22 10:11:55,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,537 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 10:11:55,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 10:11:55,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:55,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:55,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:11:55,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:11:55,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 137 [2019-11-22 10:11:55,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:55,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:11:55,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:11:56,107 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-22 10:11:56,108 INFO L567 ElimStorePlain]: treesize reduction 248, result has 20.0 percent of original size [2019-11-22 10:11:56,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:11:56,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 10:11:56,378 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-22 10:11:56,379 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:11:56,718 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-22 10:11:56,913 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-22 10:11:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [718371950] [2019-11-22 10:11:56,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:11:56,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:11:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563221097] [2019-11-22 10:11:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:11:56,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:11:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:11:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:11:56,915 INFO L87 Difference]: Start difference. First operand 361 states and 566 transitions. Second operand 8 states. [2019-11-22 10:11:57,232 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-22 10:11:59,666 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:12:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:00,986 INFO L93 Difference]: Finished difference Result 425 states and 585 transitions. [2019-11-22 10:12:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:12:00,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 10:12:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:00,996 INFO L225 Difference]: With dead ends: 425 [2019-11-22 10:12:00,996 INFO L226 Difference]: Without dead ends: 425 [2019-11-22 10:12:00,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 10:12:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-22 10:12:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 363. [2019-11-22 10:12:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-22 10:12:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 562 transitions. [2019-11-22 10:12:01,040 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 562 transitions. Word has length 13 [2019-11-22 10:12:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:01,040 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 562 transitions. [2019-11-22 10:12:01,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:12:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 562 transitions. [2019-11-22 10:12:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:12:01,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:01,042 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:01,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:01,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 320994995, now seen corresponding path program 1 times [2019-11-22 10:12:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:01,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1709016556] [2019-11-22 10:12:01,256 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-22 10:12:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:02,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 10:12:02,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:02,067 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 24=[|v_#valid_96|]} [2019-11-22 10:12:02,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,144 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-22 10:12:02,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2019-11-22 10:12:02,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:02,284 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-22 10:12:02,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:02,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:02,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:02,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 221 [2019-11-22 10:12:02,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:02,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:02,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:02,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:02,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:02,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:02,693 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-11-22 10:12:02,694 INFO L567 ElimStorePlain]: treesize reduction 391, result has 25.9 percent of original size [2019-11-22 10:12:02,695 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-22 10:12:02,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:204, output treesize:137 [2019-11-22 10:12:02,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:12:02,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:02,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 61 [2019-11-22 10:12:02,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:03,028 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-22 10:12:03,028 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.1 percent of original size [2019-11-22 10:12:03,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:03,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:127 [2019-11-22 10:12:03,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 76 treesize of output 40 [2019-11-22 10:12:03,445 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-22 10:12:03,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:03,527 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 15 treesize of output 7 [2019-11-22 10:12:03,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:03,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:03,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:03,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:126, output treesize:78 [2019-11-22 10:12:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:03,749 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:04,241 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-22 10:12:04,396 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-22 10:12:04,526 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-22 10:12:04,662 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-22 10:12:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:04,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709016556] [2019-11-22 10:12:04,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:12:04,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 10:12:04,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306596692] [2019-11-22 10:12:04,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 10:12:04,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 10:12:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-22 10:12:04,687 INFO L87 Difference]: Start difference. First operand 363 states and 562 transitions. Second operand 12 states. [2019-11-22 10:12:05,072 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-22 10:12:05,347 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-11-22 10:12:05,700 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-11-22 10:12:06,025 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-11-22 10:12:06,433 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89 [2019-11-22 10:12:07,379 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-11-22 10:12:07,637 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-11-22 10:12:08,051 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-11-22 10:12:08,692 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-11-22 10:12:09,176 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-11-22 10:12:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:11,455 INFO L93 Difference]: Finished difference Result 508 states and 729 transitions. [2019-11-22 10:12:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 10:12:11,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-22 10:12:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:11,467 INFO L225 Difference]: With dead ends: 508 [2019-11-22 10:12:11,468 INFO L226 Difference]: Without dead ends: 508 [2019-11-22 10:12:11,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2019-11-22 10:12:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-22 10:12:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 398. [2019-11-22 10:12:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-22 10:12:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 618 transitions. [2019-11-22 10:12:11,494 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 618 transitions. Word has length 19 [2019-11-22 10:12:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:11,495 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 618 transitions. [2019-11-22 10:12:11,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 10:12:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 618 transitions. [2019-11-22 10:12:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 10:12:11,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:11,498 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, 1] [2019-11-22 10:12:11,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:11,707 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 774207653, now seen corresponding path program 1 times [2019-11-22 10:12:11,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:11,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [330292695] [2019-11-22 10:12:11,709 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-22 10:12:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:11,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:12:11,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:12,009 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-22 10:12:12,010 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:12,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-22 10:12:12,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [330292695] [2019-11-22 10:12:12,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:12,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:12:12,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647726430] [2019-11-22 10:12:12,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:12:12,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:12:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:12:12,018 INFO L87 Difference]: Start difference. First operand 398 states and 618 transitions. Second operand 3 states. [2019-11-22 10:12:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:12,026 INFO L93 Difference]: Finished difference Result 374 states and 579 transitions. [2019-11-22 10:12:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:12:12,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 10:12:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:12,031 INFO L225 Difference]: With dead ends: 374 [2019-11-22 10:12:12,031 INFO L226 Difference]: Without dead ends: 374 [2019-11-22 10:12:12,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-22 10:12:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-22 10:12:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2019-11-22 10:12:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-22 10:12:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2019-11-22 10:12:12,053 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 23 [2019-11-22 10:12:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:12,055 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2019-11-22 10:12:12,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:12:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2019-11-22 10:12:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 10:12:12,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:12,057 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, 1] [2019-11-22 10:12:12,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:12,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 774207429, now seen corresponding path program 1 times [2019-11-22 10:12:12,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:12,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1160583431] [2019-11-22 10:12:12,270 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-22 10:12:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:12,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:12:12,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:12,541 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-22 10:12:12,542 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:12,554 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-22 10:12:12,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160583431] [2019-11-22 10:12:12,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:12,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:12:12,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557898327] [2019-11-22 10:12:12,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:12:12,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:12:12,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:12:12,557 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand 3 states. [2019-11-22 10:12:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:12,584 INFO L93 Difference]: Finished difference Result 542 states and 846 transitions. [2019-11-22 10:12:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:12:12,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 10:12:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:12,589 INFO L225 Difference]: With dead ends: 542 [2019-11-22 10:12:12,590 INFO L226 Difference]: Without dead ends: 542 [2019-11-22 10:12:12,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-22 10:12:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-22 10:12:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 524. [2019-11-22 10:12:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-22 10:12:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 823 transitions. [2019-11-22 10:12:12,616 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 823 transitions. Word has length 23 [2019-11-22 10:12:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:12,619 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 823 transitions. [2019-11-22 10:12:12,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:12:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 823 transitions. [2019-11-22 10:12:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 10:12:12,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:12,622 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, 1, 1] [2019-11-22 10:12:12,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:12,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1769373397, now seen corresponding path program 1 times [2019-11-22 10:12:12,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [843367259] [2019-11-22 10:12:12,832 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-22 10:12:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:13,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 10:12:13,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12: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-22 10:12:13,109 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:13,167 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-22 10:12:13,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [843367259] [2019-11-22 10:12:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:12:13,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576923618] [2019-11-22 10:12:13,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:12:13,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:12:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:12:13,169 INFO L87 Difference]: Start difference. First operand 524 states and 823 transitions. Second operand 4 states. [2019-11-22 10:12:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:13,325 INFO L93 Difference]: Finished difference Result 618 states and 921 transitions. [2019-11-22 10:12:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:12:13,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 10:12:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:13,332 INFO L225 Difference]: With dead ends: 618 [2019-11-22 10:12:13,333 INFO L226 Difference]: Without dead ends: 618 [2019-11-22 10:12:13,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-22 10:12:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-22 10:12:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 589. [2019-11-22 10:12:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-22 10:12:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 910 transitions. [2019-11-22 10:12:13,365 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 910 transitions. Word has length 24 [2019-11-22 10:12:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:13,366 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 910 transitions. [2019-11-22 10:12:13,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:12:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 910 transitions. [2019-11-22 10:12:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 10:12:13,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:13,372 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:13,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:13,587 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1420785925, now seen corresponding path program 1 times [2019-11-22 10:12:13,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:13,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [614561126] [2019-11-22 10:12:13,588 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-22 10:12:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:13,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:12:13,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:13,956 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:14,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [614561126] [2019-11-22 10:12:14,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:12:14,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 10:12:14,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10638418] [2019-11-22 10:12:14,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:12:14,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:14,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:12:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:12:14,010 INFO L87 Difference]: Start difference. First operand 589 states and 910 transitions. Second operand 8 states. [2019-11-22 10:12:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:14,195 INFO L93 Difference]: Finished difference Result 613 states and 948 transitions. [2019-11-22 10:12:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:12:14,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 10:12:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:14,200 INFO L225 Difference]: With dead ends: 613 [2019-11-22 10:12:14,200 INFO L226 Difference]: Without dead ends: 613 [2019-11-22 10:12:14,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:12:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-22 10:12:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 534. [2019-11-22 10:12:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-22 10:12:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 773 transitions. [2019-11-22 10:12:14,232 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 773 transitions. Word has length 25 [2019-11-22 10:12:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:14,232 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 773 transitions. [2019-11-22 10:12:14,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:12:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 773 transitions. [2019-11-22 10:12:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:12:14,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:14,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:14,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:14,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1457748217, now seen corresponding path program 1 times [2019-11-22 10:12:14,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:14,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [710098425] [2019-11-22 10:12:14,446 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-22 10:12:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:14,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:12:14,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:14,729 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:14,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [710098425] [2019-11-22 10:12:14,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:14,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:12:14,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836944569] [2019-11-22 10:12:14,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:12:14,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:12:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:12:14,778 INFO L87 Difference]: Start difference. First operand 534 states and 773 transitions. Second operand 3 states. [2019-11-22 10:12:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:14,790 INFO L93 Difference]: Finished difference Result 379 states and 534 transitions. [2019-11-22 10:12:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:12:14,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 10:12:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:14,793 INFO L225 Difference]: With dead ends: 379 [2019-11-22 10:12:14,794 INFO L226 Difference]: Without dead ends: 379 [2019-11-22 10:12:14,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-22 10:12:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-22 10:12:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-11-22 10:12:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-22 10:12:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 534 transitions. [2019-11-22 10:12:14,810 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 534 transitions. Word has length 33 [2019-11-22 10:12:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:14,810 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 534 transitions. [2019-11-22 10:12:14,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:12:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 534 transitions. [2019-11-22 10:12:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:12:14,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:14,813 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:15,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:15,017 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1677657770, now seen corresponding path program 1 times [2019-11-22 10:12:15,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:15,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1662128032] [2019-11-22 10:12:15,020 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-22 10:12:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:15,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:12:15,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:15,860 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:12:15,861 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:12:15,861 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 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 10:12:15,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:15,996 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 10:12:15,997 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 10:12:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,000 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 1 xjuncts. [2019-11-22 10:12:16,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 10:12:16,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:16,550 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 10:12:16,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:16,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:12:16,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:16,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:16,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:12:16,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:16,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:16,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:12:16,903 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:16,908 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:16,908 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:16,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:16,913 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:16,918 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:16,918 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:17,038 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 10:12:17,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:17,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:12:17,040 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:17,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:17,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:12:17,107 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 10:12:17,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:17,306 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 10:12:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:12:17,381 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:12:17,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1662128032] [2019-11-22 10:12:17,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:12:17,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 10:12:17,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113145753] [2019-11-22 10:12:17,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 10:12:17,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 10:12:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:12:17,745 INFO L87 Difference]: Start difference. First operand 379 states and 534 transitions. Second operand 14 states. [2019-11-22 10:12:19,358 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-22 10:12:21,586 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 10:12:26,194 WARN L192 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 10:12:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:27,870 INFO L93 Difference]: Finished difference Result 481 states and 644 transitions. [2019-11-22 10:12:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 10:12:27,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 10:12:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:27,876 INFO L225 Difference]: With dead ends: 481 [2019-11-22 10:12:27,876 INFO L226 Difference]: Without dead ends: 475 [2019-11-22 10:12:27,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 10:12:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-22 10:12:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 423. [2019-11-22 10:12:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-22 10:12:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 588 transitions. [2019-11-22 10:12:27,892 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 588 transitions. Word has length 33 [2019-11-22 10:12:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:27,893 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 588 transitions. [2019-11-22 10:12:27,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 10:12:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 588 transitions. [2019-11-22 10:12:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 10:12:27,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:27,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:28,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:28,099 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1915451196, now seen corresponding path program 1 times [2019-11-22 10:12:28,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:28,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1783061779] [2019-11-22 10:12:28,100 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-22 10:12:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:28,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 10:12:28,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:29,062 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:12:29,063 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:12:29,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:12:29,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:29,206 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 10:12:29,207 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 10:12:29,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:12:29,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 10:12:29,228 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 7 treesize of output 5 [2019-11-22 10:12:29,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:29,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:29,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:12:29,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 10:12:29,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:29,310 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-22 10:12:29,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:29,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:29,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:29,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 10:12:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:29,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:30,064 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 10:12:30,589 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 10:12:30,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:12:30,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:30,804 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-22 10:12:30,808 INFO L168 Benchmark]: Toolchain (without parser) took 62322.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.0 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -67.0 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. [2019-11-22 10:12:30,809 INFO L168 Benchmark]: CDTParser took 0.33 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-22 10:12:30,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:12:30,809 INFO L168 Benchmark]: Boogie Preprocessor took 114.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:12:30,810 INFO L168 Benchmark]: RCFGBuilder took 919.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:12:30,810 INFO L168 Benchmark]: TraceAbstraction took 60530.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -16.8 MB). Peak memory consumption was 279.4 MB. Max. memory is 11.5 GB. [2019-11-22 10:12:30,812 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.33 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 752.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 919.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60530.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -16.8 MB). Peak memory consumption was 279.4 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...