./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a88b43a3 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/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-a88b43a [2019-11-20 12:28:13,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 12:28:13,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 12:28:13,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 12:28:13,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 12:28:13,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 12:28:13,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 12:28:13,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 12:28:13,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 12:28:13,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 12:28:13,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 12:28:13,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 12:28:13,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 12:28:13,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 12:28:13,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 12:28:13,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 12:28:13,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 12:28:13,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 12:28:13,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 12:28:13,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 12:28:13,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 12:28:13,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 12:28:13,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 12:28:13,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 12:28:13,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 12:28:13,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 12:28:13,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 12:28:13,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 12:28:13,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 12:28:13,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 12:28:13,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 12:28:13,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 12:28:13,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 12:28:13,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 12:28:13,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 12:28:13,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 12:28:13,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 12:28:13,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 12:28:13,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 12:28:13,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 12:28:13,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 12:28:13,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-20 12:28:13,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 12:28:13,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 12:28:13,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 12:28:13,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 12:28:13,594 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 12:28:13,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 12:28:13,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 12:28:13,595 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 12:28:13,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 12:28:13,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 12:28:13,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 12:28:13,597 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 12:28:13,597 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 12:28:13,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 12:28:13,598 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 12:28:13,598 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 12:28:13,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 12:28:13,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 12:28:13,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 12:28:13,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 12:28:13,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 12:28:13,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 12:28:13,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 12:28:13,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 12:28:13,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 12:28:13,601 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 12:28:13,601 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 12:28:13,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 12:28:13,601 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-memcleanup) ) 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-20 12:28:13,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 12:28:13,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 12:28:13,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 12:28:13,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 12:28:13,910 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 12:28:13,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 12:28:13,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d78fa76/b95046777f544dd398fb556364c2d67f/FLAGbd21c915c [2019-11-20 12:28:14,512 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 12:28:14,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 12:28:14,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d78fa76/b95046777f544dd398fb556364c2d67f/FLAGbd21c915c [2019-11-20 12:28:14,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d78fa76/b95046777f544dd398fb556364c2d67f [2019-11-20 12:28:14,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 12:28:14,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 12:28:14,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 12:28:14,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 12:28:14,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 12:28:14,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:28:14" (1/1) ... [2019-11-20 12:28:14,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10724550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:14, skipping insertion in model container [2019-11-20 12:28:14,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:28:14" (1/1) ... [2019-11-20 12:28:14,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 12:28:14,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 12:28:15,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 12:28:15,310 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 12:28:15,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 12:28:15,421 INFO L192 MainTranslator]: Completed translation [2019-11-20 12:28:15,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15 WrapperNode [2019-11-20 12:28:15,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 12:28:15,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 12:28:15,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 12:28:15,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 12:28:15,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... [2019-11-20 12:28:15,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 12:28:15,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 12:28:15,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 12:28:15,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 12:28:15,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 12:28:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 12:28:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 12:28:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 12:28:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 12:28:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 12:28:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 12:28:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 12:28:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 12:28:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 12:28:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 12:28:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 12:28:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 12:28:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 12:28:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 12:28:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 12:28:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 12:28:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 12:28:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 12:28:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 12:28:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 12:28:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 12:28:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 12:28:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 12:28:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 12:28:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 12:28:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 12:28:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 12:28:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 12:28:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 12:28:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 12:28:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 12:28:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 12:28:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 12:28:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 12:28:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 12:28:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 12:28:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 12:28:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 12:28:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 12:28:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 12:28:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 12:28:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 12:28:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 12:28:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 12:28:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 12:28:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 12:28:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 12:28:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 12:28:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 12:28:15,915 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 12:28:16,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 12:28:16,280 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 12:28:16,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:28:16 BoogieIcfgContainer [2019-11-20 12:28:16,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 12:28:16,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 12:28:16,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 12:28:16,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 12:28:16,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:28:14" (1/3) ... [2019-11-20 12:28:16,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c84ccea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:28:16, skipping insertion in model container [2019-11-20 12:28:16,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:15" (2/3) ... [2019-11-20 12:28:16,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c84ccea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:28:16, skipping insertion in model container [2019-11-20 12:28:16,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:28:16" (3/3) ... [2019-11-20 12:28:16,291 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-20 12:28:16,302 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 12:28:16,310 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-20 12:28:16,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-20 12:28:16,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 12:28:16,345 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 12:28:16,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 12:28:16,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 12:28:16,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 12:28:16,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 12:28:16,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 12:28:16,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 12:28:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-20 12:28:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 12:28:16,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:16,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:16,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-20 12:28:16,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:16,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1131919341] [2019-11-20 12:28:16,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:16,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 12:28:16,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:16,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:16,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:16,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:16,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:16,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:28:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:16,723 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:16,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131919341] [2019-11-20 12:28:16,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:16,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 12:28:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812540149] [2019-11-20 12:28:16,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:28:16,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:16,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:28:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:28:16,761 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-20 12:28:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:17,100 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-20 12:28:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:28:17,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 12:28:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:17,111 INFO L225 Difference]: With dead ends: 99 [2019-11-20 12:28:17,111 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 12:28:17,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:28:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 12:28:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-20 12:28:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 12:28:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-20 12:28:17,157 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-20 12:28:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:17,157 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-20 12:28:17,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:28:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-20 12:28:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 12:28:17,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:17,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:17,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:17,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-20 12:28:17,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:17,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1869100349] [2019-11-20 12:28:17,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:17,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 12:28:17,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:17,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:17,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:17,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:17,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:17,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:28:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:17,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:17,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1869100349] [2019-11-20 12:28:17,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:17,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 12:28:17,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885183564] [2019-11-20 12:28:17,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 12:28:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 12:28:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 12:28:17,735 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-20 12:28:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:18,192 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 12:28:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:28:18,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 12:28:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:18,195 INFO L225 Difference]: With dead ends: 95 [2019-11-20 12:28:18,196 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 12:28:18,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:28:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 12:28:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-20 12:28:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 12:28:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-20 12:28:18,207 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-20 12:28:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:18,208 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-20 12:28:18,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 12:28:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-20 12:28:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 12:28:18,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:18,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:18,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:18,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:18,424 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-20 12:28:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:18,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1120097102] [2019-11-20 12:28:18,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:18,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:28:18,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:18,716 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:18,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120097102] [2019-11-20 12:28:18,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:18,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-20 12:28:18,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788740532] [2019-11-20 12:28:18,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 12:28:18,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:18,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 12:28:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 12:28:18,756 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-20 12:28:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:19,164 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-20 12:28:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:28:19,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 12:28:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:19,167 INFO L225 Difference]: With dead ends: 91 [2019-11-20 12:28:19,168 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 12:28:19,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:28:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 12:28:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-20 12:28:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 12:28:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-20 12:28:19,176 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-20 12:28:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:19,177 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-20 12:28:19,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 12:28:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-20 12:28:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:28:19,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:19,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:19,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:19,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-20 12:28:19,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1081806647] [2019-11-20 12:28:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:19,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:28:19,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:19,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:19,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081806647] [2019-11-20 12:28:19,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:19,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 12:28:19,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524061403] [2019-11-20 12:28:19,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 12:28:19,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 12:28:19,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:28:19,600 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-20 12:28:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:19,843 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 12:28:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 12:28:19,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 12:28:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:19,845 INFO L225 Difference]: With dead ends: 95 [2019-11-20 12:28:19,845 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 12:28:19,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:28:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 12:28:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-20 12:28:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 12:28:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-20 12:28:19,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-20 12:28:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:19,853 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-20 12:28:19,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 12:28:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-20 12:28:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:28:19,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:19,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:20,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:20,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-20 12:28:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:20,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1087905461] [2019-11-20 12:28:20,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:20,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 12:28:20,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:20,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 12:28:20,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:20,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:20,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:20,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 12:28:20,377 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 17 treesize of output 9 [2019-11-20 12:28:20,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:20,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:20,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:20,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 12:28:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:20,391 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:20,458 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 16 treesize of output 12 [2019-11-20 12:28:20,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 12:28:20,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:20,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 12:28:20,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 12:28:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:20,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1087905461] [2019-11-20 12:28:20,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:20,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 12:28:20,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229770968] [2019-11-20 12:28:20,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 12:28:20,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 12:28:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 12:28:20,518 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-20 12:28:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:21,348 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-20 12:28:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 12:28:21,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-20 12:28:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:21,357 INFO L225 Difference]: With dead ends: 230 [2019-11-20 12:28:21,357 INFO L226 Difference]: Without dead ends: 226 [2019-11-20 12:28:21,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-20 12:28:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-20 12:28:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-20 12:28:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 12:28:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-20 12:28:21,368 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-20 12:28:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:21,369 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-20 12:28:21,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 12:28:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-20 12:28:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:28:21,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:21,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:21,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:21,575 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-20 12:28:21,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:21,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [352390890] [2019-11-20 12:28:21,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:21,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 12:28:21,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:21,732 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:21,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [352390890] [2019-11-20 12:28:21,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:21,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 12:28:21,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820163519] [2019-11-20 12:28:21,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:28:21,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:28:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:28:21,746 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-20 12:28:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:21,763 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-20 12:28:21,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 12:28:21,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-20 12:28:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:21,765 INFO L225 Difference]: With dead ends: 145 [2019-11-20 12:28:21,765 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 12:28:21,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:28:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 12:28:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-20 12:28:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 12:28:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-20 12:28:21,783 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-20 12:28:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:21,783 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-20 12:28:21,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:28:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-20 12:28:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:28:21,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:21,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:21,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:21,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-20 12:28:21,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:21,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1942762367] [2019-11-20 12:28:21,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:22,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 12:28:22,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:22,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:22,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 12:28:22,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:22,240 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 12:28:22,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:22,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-20 12:28:22,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:28:22,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:22,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:22,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:22,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-20 12:28:22,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-20 12:28:22,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:22,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:22,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:28:22,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-20 12:28:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:22,359 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:22,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1942762367] [2019-11-20 12:28:22,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:22,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 12:28:22,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983193477] [2019-11-20 12:28:22,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 12:28:22,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 12:28:22,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:28:22,403 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-20 12:28:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:22,899 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-20 12:28:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 12:28:22,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 12:28:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:22,903 INFO L225 Difference]: With dead ends: 115 [2019-11-20 12:28:22,903 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 12:28:22,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 12:28:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 12:28:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-20 12:28:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 12:28:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-20 12:28:22,910 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-20 12:28:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-20 12:28:22,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 12:28:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-20 12:28:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:28:22,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:22,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:23,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:23,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-20 12:28:23,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:23,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [450772187] [2019-11-20 12:28:23,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:23,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 12:28:23,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:23,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:23,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:23,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:28:23,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:28:23,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:23,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:28:23,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:23,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 12:28:23,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 12:28:23,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:23,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 12:28:23,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:23,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:23,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-20 12:28:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:23,454 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:23,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [450772187] [2019-11-20 12:28:23,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:23,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 12:28:23,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657961232] [2019-11-20 12:28:23,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 12:28:23,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 12:28:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 12:28:23,624 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-20 12:28:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:24,679 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-20 12:28:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 12:28:24,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 12:28:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:24,682 INFO L225 Difference]: With dead ends: 125 [2019-11-20 12:28:24,682 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 12:28:24,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 12:28:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 12:28:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-20 12:28:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 12:28:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-20 12:28:24,689 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-20 12:28:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:24,689 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-20 12:28:24,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 12:28:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-20 12:28:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 12:28:24,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:24,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:24,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:24,893 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-20 12:28:24,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:24,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [512527172] [2019-11-20 12:28:24,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:25,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 12:28:25,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:25,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:25,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:25,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:25,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:25,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:28:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:25,174 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:27,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [512527172] [2019-11-20 12:28:27,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:27,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 12:28:27,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036621641] [2019-11-20 12:28:27,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 12:28:27,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 12:28:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 12:28:27,292 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-20 12:28:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:27,755 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-20 12:28:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 12:28:27,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 12:28:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:27,758 INFO L225 Difference]: With dead ends: 111 [2019-11-20 12:28:27,758 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 12:28:27,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2019-11-20 12:28:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 12:28:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-20 12:28:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 12:28:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-20 12:28:27,764 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-20 12:28:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:27,764 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-20 12:28:27,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 12:28:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-20 12:28:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 12:28:27,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:27,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:27,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:27,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-20 12:28:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:27,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [72368829] [2019-11-20 12:28:27,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:28,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 12:28:28,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:28,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 12:28:28,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:28,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:28,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:28,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 12:28:28,289 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 17 treesize of output 9 [2019-11-20 12:28:28,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:28,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:28,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:28,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 12:28:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:28,309 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:28,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:28,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2019-11-20 12:28:28,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:28,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:28,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:28,493 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-20 12:28:28,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 12:28:28,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-20 12:28:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:28,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72368829] [2019-11-20 12:28:28,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:28,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 12:28:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268727874] [2019-11-20 12:28:28,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 12:28:28,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 12:28:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-20 12:28:28,526 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-20 12:28:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:31,064 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-20 12:28:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 12:28:31,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-20 12:28:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:31,066 INFO L225 Difference]: With dead ends: 112 [2019-11-20 12:28:31,066 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 12:28:31,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-20 12:28:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 12:28:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-20 12:28:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 12:28:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-20 12:28:31,070 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-20 12:28:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:31,071 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-20 12:28:31,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 12:28:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-20 12:28:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 12:28:31,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:31,072 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, 1, 1, 1, 1, 1] [2019-11-20 12:28:31,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:31,276 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-20 12:28:31,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:31,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [948255963] [2019-11-20 12:28:31,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:31,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 12:28:31,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:31,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:31,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:28:31,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 12:28:31,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 12:28:31,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:28:31,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 12:28:31,614 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-20 12:28:31,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:28:31,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:28:31,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 13 [2019-11-20 12:28:31,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 12:28:31,722 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 20 treesize of output 8 [2019-11-20 12:28:31,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-20 12:28:31,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-20 12:28:31,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,808 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-20 12:28:31,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-20 12:28:31,887 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 26 treesize of output 14 [2019-11-20 12:28:31,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:31,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:31,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-20 12:28:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:31,926 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:32,190 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:28:32,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:32,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 12:28:32,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-20 12:28:34,406 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 274 treesize of output 266 [2019-11-20 12:28:34,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 12:28:34,625 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-20 12:28:34,626 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-20 12:28:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:34,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 12:28:34,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-20 12:28:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:28:34,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [948255963] [2019-11-20 12:28:34,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 12:28:34,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 12:28:34,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555072989] [2019-11-20 12:28:34,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 12:28:34,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 12:28:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-20 12:28:34,878 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-20 12:28:36,388 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-20 12:28:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:37,389 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-20 12:28:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 12:28:37,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-20 12:28:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:37,390 INFO L225 Difference]: With dead ends: 101 [2019-11-20 12:28:37,390 INFO L226 Difference]: Without dead ends: 97 [2019-11-20 12:28:37,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-20 12:28:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-20 12:28:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-20 12:28:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 12:28:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-20 12:28:37,395 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-20 12:28:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-20 12:28:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 12:28:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-20 12:28:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 12:28:37,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:37,397 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:28:37,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:37,600 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-20 12:28:37,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:37,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1400459620] [2019-11-20 12:28:37,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:37,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 12:28:37,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 12:28:37,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:28:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 12:28:37,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1400459620] [2019-11-20 12:28:37,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:28:37,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 12:28:37,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043920749] [2019-11-20 12:28:37,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 12:28:37,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:28:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 12:28:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 12:28:37,830 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-20 12:28:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:28:37,850 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-20 12:28:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 12:28:37,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 12:28:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:28:37,852 INFO L225 Difference]: With dead ends: 122 [2019-11-20 12:28:37,852 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 12:28:37,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 12:28:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 12:28:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-20 12:28:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 12:28:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-20 12:28:37,859 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-20 12:28:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:28:37,859 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-20 12:28:37,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 12:28:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-20 12:28:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 12:28:37,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:28:37,863 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-20 12:28:38,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:38,067 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:28:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:28:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-20 12:28:38,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:28:38,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [912805784] [2019-11-20 12:28:38,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:28:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:28:38,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 12:28:38,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:28:38,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:28:38,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:38,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:28:38,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:38,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:28:38,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:38,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-20 12:28:38,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:28:38,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:38,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:38,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-20 12:28:46,667 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 12:28:46,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:46,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 51 [2019-11-20 12:28:46,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,701 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-20 12:28:46,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-20 12:28:46,725 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:46,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:28:46,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:46,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-20 12:28:46,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:46,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-20 12:28:46,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,870 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-20 12:28:46,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:28:46,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-20 12:28:47,124 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 12:28:47,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:28:47,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-20 12:28:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:28:47,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:28:47,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-20 12:29:46,733 WARN L192 SmtUtils]: Spent 59.58 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-20 12:29:46,734 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-20 12:29:46,735 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-20 12:29:46,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-20 12:29:46,866 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 27 treesize of output 15 [2019-11-20 12:29:46,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:29:46,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:29:46,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:29:46,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-20 12:29:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:29:46,939 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:29:47,041 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:29:47,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:29:47,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 12:29:47,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-20 12:29:48,733 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-20 12:29:48,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:29:48,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-11-20 12:29:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:29:48,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:29:48,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:29:48,765 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-20 12:29:48,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-20 12:29:55,197 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:29:55,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:29:55,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 12:29:55,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-20 12:30:12,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:12,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 12:30:12,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:12,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:12,887 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-20 12:30:12,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-20 12:30:13,340 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 1694 treesize of output 1670 [2019-11-20 12:30:13,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:13,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:13,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 12:30:15,085 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-20 12:30:15,086 INFO L567 ElimStorePlain]: treesize reduction 52159, result has 0.2 percent of original size [2019-11-20 12:30:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:15,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 12:30:15,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:15 [2019-11-20 12:30:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:30:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:30:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912805784] [2019-11-20 12:30:18,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 12:30:18,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-11-20 12:30:18,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283174316] [2019-11-20 12:30:18,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 12:30:18,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:30:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 12:30:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=722, Unknown=7, NotChecked=0, Total=812 [2019-11-20 12:30:18,362 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 29 states. [2019-11-20 12:30:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:30:41,247 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2019-11-20 12:30:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 12:30:41,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-20 12:30:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:30:41,249 INFO L225 Difference]: With dead ends: 159 [2019-11-20 12:30:41,249 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 12:30:41,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=316, Invalid=1931, Unknown=9, NotChecked=0, Total=2256 [2019-11-20 12:30:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 12:30:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2019-11-20 12:30:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 12:30:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-20 12:30:41,255 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-20 12:30:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:30:41,255 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-20 12:30:41,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 12:30:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-20 12:30:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 12:30:41,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:30:41,257 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-20 12:30:41,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:30:41,460 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 12:30:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:30:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-20 12:30:41,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:30:41,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [453846309] [2019-11-20 12:30:41,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:30:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:30:41,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 12:30:41,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:30:41,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 12:30:41,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:30:41,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 12:30:41,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 12:30:41,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:30:41,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 12:30:41,848 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-20 12:30:41,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:30:41,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:30:41,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 13 [2019-11-20 12:30:41,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,909 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 12:30:41,942 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 20 treesize of output 8 [2019-11-20 12:30:41,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:41,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:41,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-20 12:30:42,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-20 12:30:42,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 12:30:42,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:30:42,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-20 12:30:42,154 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-20 12:30:42,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 12:30:42,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:30:42,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2019-11-20 12:30:42,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-20 12:30:42,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 12:30:42,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,290 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-20 12:30:42,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-20 12:30:42,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 54 [2019-11-20 12:30:42,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,547 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-20 12:30:42,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:42,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:42,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-20 12:30:42,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:42,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:30:42,729 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 24 treesize of output 12 [2019-11-20 12:30:42,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:30:42,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-20 12:30:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:30:42,780 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:30:42,917 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:42,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:42,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:42,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-20 12:30:45,089 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 12:30:51,200 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 12:30:59,323 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 12:30:59,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:59,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 12:30:59,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:30:59,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:59,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:59,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-20 12:30:59,486 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:59,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:30:59,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 12:30:59,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-20 12:31:06,118 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 3002 treesize of output 2970 [2019-11-20 12:31:06,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 12:31:07,101 WARN L192 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-20 12:31:07,102 INFO L567 ElimStorePlain]: treesize reduction 2845, result has 2.3 percent of original size [2019-11-20 12:31:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:31:07,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:31:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:31:07,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:31:07,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-20 12:31:07,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-11-20 12:31:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:31:08,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [453846309] [2019-11-20 12:31:08,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 12:31:08,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-20 12:31:08,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729013538] [2019-11-20 12:31:08,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 12:31:08,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:31:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 12:31:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=677, Unknown=7, NotChecked=0, Total=812 [2019-11-20 12:31:08,066 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-20 12:31:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:31:10,620 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-20 12:31:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 12:31:10,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-20 12:31:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:31:10,621 INFO L225 Difference]: With dead ends: 60 [2019-11-20 12:31:10,621 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 12:31:10,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=359, Invalid=1440, Unknown=7, NotChecked=0, Total=1806 [2019-11-20 12:31:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 12:31:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 12:31:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 12:31:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 12:31:10,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 12:31:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:31:10,623 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 12:31:10,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 12:31:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 12:31:10,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 12:31:10,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:31:10,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:31:10 BoogieIcfgContainer [2019-11-20 12:31:10,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 12:31:10,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 12:31:10,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 12:31:10,832 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 12:31:10,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:28:16" (3/4) ... [2019-11-20 12:31:10,836 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 12:31:10,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-20 12:31:10,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-20 12:31:10,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-20 12:31:10,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-20 12:31:10,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-20 12:31:10,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-20 12:31:10,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-20 12:31:10,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-20 12:31:10,848 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 12:31:10,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 12:31:10,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 12:31:10,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 12:31:10,908 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-20 12:31:10,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 12:31:10,909 INFO L168 Benchmark]: Toolchain (without parser) took 176100.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,910 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 12:31:10,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,911 INFO L168 Benchmark]: Boogie Preprocessor took 89.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,911 INFO L168 Benchmark]: RCFGBuilder took 768.67 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,912 INFO L168 Benchmark]: TraceAbstraction took 174547.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -72.2 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,912 INFO L168 Benchmark]: Witness Printer took 76.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 842.4 kB). Peak memory consumption was 842.4 kB. Max. memory is 11.5 GB. [2019-11-20 12:31:10,914 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.26 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 612.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.67 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174547.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -72.2 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * Witness Printer took 76.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 842.4 kB). Peak memory consumption was 842.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 29 error locations. Result: SAFE, OverallTime: 174.4s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 631 SDtfs, 2257 SDslu, 2339 SDs, 0 SdLazy, 3019 SolverSat, 428 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 469 SyntacticMatches, 11 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 72.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 367 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 133.5s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 62 QuantifiedInterpolants, 153827 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 34/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...