./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 05:34:25,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:34:25,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:34:25,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:34:25,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:34:25,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:34:25,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:34:25,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:34:25,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:34:25,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:34:25,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:34:25,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:34:25,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:34:25,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:34:25,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:34:25,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:34:25,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:34:25,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:34:25,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:34:25,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:34:25,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:34:25,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:34:25,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:34:25,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:34:25,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:34:25,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:34:25,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:34:25,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:34:25,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:34:25,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:34:25,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:34:25,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:34:25,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:34:25,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:34:25,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:34:25,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:34:25,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:34:25,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:34:25,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:34:25,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:34:25,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:34:25,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 05:34:25,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:34:25,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:34:25,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:34:25,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:34:25,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:34:25,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:34:25,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:34:25,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 05:34:25,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:34:25,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:34:25,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:34:25,594 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 05:34:25,594 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 05:34:25,595 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 05:34:25,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:34:25,595 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 05:34:25,595 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 05:34:25,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:34:25,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:34:25,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:34:25,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:34:25,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:34:25,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:34:25,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:34:25,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:34:25,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:34:25,597 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 05:34:25,598 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 05:34:25,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 05:34:25,598 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-11-20 05:34:25,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:34:25,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:34:25,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:34:25,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:34:25,782 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:34:25,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-20 05:34:25,840 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/data/6bb8b1fa8/5a28e45cb80a4e07a217c9f8c2c49ae3/FLAG36a7540d3 [2019-11-20 05:34:26,408 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:34:26,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-20 05:34:26,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/data/6bb8b1fa8/5a28e45cb80a4e07a217c9f8c2c49ae3/FLAG36a7540d3 [2019-11-20 05:34:26,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/data/6bb8b1fa8/5a28e45cb80a4e07a217c9f8c2c49ae3 [2019-11-20 05:34:26,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:34:26,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 05:34:26,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:34:26,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:34:26,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:34:26,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:34:26" (1/1) ... [2019-11-20 05:34:26,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5c665e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:26, skipping insertion in model container [2019-11-20 05:34:26,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:34:26" (1/1) ... [2019-11-20 05:34:26,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:34:26,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:34:27,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:34:27,176 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:34:27,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:34:27,276 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:34:27,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27 WrapperNode [2019-11-20 05:34:27,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:34:27,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:34:27,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:34:27,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:34:27,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... [2019-11-20 05:34:27,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:34:27,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:34:27,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:34:27,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:34:27,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 05:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 05:34:27,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 05:34:27,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 05:34:27,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 05:34:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 05:34:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-11-20 05:34:27,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 05:34:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 05:34:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 05:34:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 05:34:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 05:34:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 05:34:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 05:34:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 05:34:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 05:34:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 05:34:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 05:34:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 05:34:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 05:34:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 05:34:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 05:34:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 05:34:27,443 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 05:34:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 05:34:27,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 05:34:27,446 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 05:34:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:34:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 05:34:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:34:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 05:34:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:34:28,147 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:34:28,148 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 05:34:28,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:28 BoogieIcfgContainer [2019-11-20 05:34:28,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:34:28,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:34:28,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:34:28,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:34:28,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:34:26" (1/3) ... [2019-11-20 05:34:28,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a737a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:28, skipping insertion in model container [2019-11-20 05:34:28,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:27" (2/3) ... [2019-11-20 05:34:28,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a737a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:28, skipping insertion in model container [2019-11-20 05:34:28,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:28" (3/3) ... [2019-11-20 05:34:28,156 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-11-20 05:34:28,167 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:34:28,174 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-20 05:34:28,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-20 05:34:28,208 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:34:28,208 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 05:34:28,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:34:28,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:34:28,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:34:28,209 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:34:28,209 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:34:28,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:34:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-11-20 05:34:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 05:34:28,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:28,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:28,235 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1915750614, now seen corresponding path program 1 times [2019-11-20 05:34:28,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:28,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [392474535] [2019-11-20 05:34:28,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:28,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:34:28,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:28,537 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 05:34:28,538 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:28,594 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 05:34:28,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392474535] [2019-11-20 05:34:28,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:28,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:34:28,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380670522] [2019-11-20 05:34:28,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:34:28,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:34:28,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:28,621 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2019-11-20 05:34:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:28,785 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-20 05:34:28,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:28,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 05:34:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:28,804 INFO L225 Difference]: With dead ends: 72 [2019-11-20 05:34:28,805 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 05:34:28,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 05:34:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-20 05:34:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 05:34:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-20 05:34:28,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2019-11-20 05:34:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:28,874 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-20 05:34:28,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:34:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-20 05:34:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 05:34:28,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:28,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:29,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:29,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1917597656, now seen corresponding path program 1 times [2019-11-20 05:34:29,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:29,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1988590879] [2019-11-20 05:34:29,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:29,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:34:29,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:29,358 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_31|]} [2019-11-20 05:34:29,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:29,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:29,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:29,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:29,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:29,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-20 05:34:29,504 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 05:34:29,504 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:29,643 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 05:34:29,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:29,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:29,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:34:29,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:29,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:29,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-20 05:34:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:29,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988590879] [2019-11-20 05:34:29,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:29,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 05:34:29,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803858263] [2019-11-20 05:34:29,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:34:29,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:34:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:34:29,701 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-20 05:34:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:30,283 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-20 05:34:30,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:30,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-20 05:34:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:30,286 INFO L225 Difference]: With dead ends: 73 [2019-11-20 05:34:30,286 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 05:34:30,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:34:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 05:34:30,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2019-11-20 05:34:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 05:34:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-20 05:34:30,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 11 [2019-11-20 05:34:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:30,295 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-20 05:34:30,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:34:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-20 05:34:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 05:34:30,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:30,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:30,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:30,516 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1917597655, now seen corresponding path program 1 times [2019-11-20 05:34:30,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:30,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1930232437] [2019-11-20 05:34:30,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:30,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:34:30,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:30,728 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:34:30,728 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 19 treesize of output 18 [2019-11-20 05:34:30,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:30,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:30,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:30,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-20 05:34:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:30,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:30,776 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 05:34:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1930232437] [2019-11-20 05:34:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:30,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 05:34:30,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360282290] [2019-11-20 05:34:30,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:34:30,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:34:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:34:30,778 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2019-11-20 05:34:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:30,895 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-20 05:34:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:34:30,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 05:34:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:30,897 INFO L225 Difference]: With dead ends: 51 [2019-11-20 05:34:30,897 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 05:34:30,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 05:34:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 05:34:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-20 05:34:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 05:34:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-11-20 05:34:30,905 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 11 [2019-11-20 05:34:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:30,905 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-11-20 05:34:30,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:34:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-11-20 05:34:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:34:30,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:30,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:31,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:31,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1504681331, now seen corresponding path program 1 times [2019-11-20 05:34:31,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:31,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [140247406] [2019-11-20 05:34:31,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:31,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:34:31,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:31,338 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_41|]} [2019-11-20 05:34:31,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:31,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:31,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:31,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:31,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:31,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:31,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:31,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:31,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:14 [2019-11-20 05:34:31,435 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 05:34:31,436 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:34:31,554 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 05:34:31,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:31,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:31,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:31,575 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 05:34:31,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 05:34:31,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:11 [2019-11-20 05:34:31,623 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 05:34:31,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [140247406] [2019-11-20 05:34:31,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:31,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 05:34:31,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997280217] [2019-11-20 05:34:31,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:34:31,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:31,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:34:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:31,625 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2019-11-20 05:34:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:32,115 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-20 05:34:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:34:32,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 05:34:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:32,119 INFO L225 Difference]: With dead ends: 65 [2019-11-20 05:34:32,119 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 05:34:32,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:34:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 05:34:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-11-20 05:34:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 05:34:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-20 05:34:32,126 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2019-11-20 05:34:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:32,127 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-20 05:34:32,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:34:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-20 05:34:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:34:32,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:32,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:32,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:32,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1504681279, now seen corresponding path program 1 times [2019-11-20 05:34:32,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:32,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1518463710] [2019-11-20 05:34:32,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:32,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:34:32,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:32,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:32,550 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 05:34:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1518463710] [2019-11-20 05:34:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:34:32,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395817564] [2019-11-20 05:34:32,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:34:32,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:34:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:32,552 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-11-20 05:34:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:32,671 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-20 05:34:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:32,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 05:34:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:32,705 INFO L225 Difference]: With dead ends: 70 [2019-11-20 05:34:32,706 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 05:34:32,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 05:34:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-11-20 05:34:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 05:34:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-20 05:34:32,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 13 [2019-11-20 05:34:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:32,713 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-20 05:34:32,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:34:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-11-20 05:34:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:34:32,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:32,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:32,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:32,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1447422977, now seen corresponding path program 1 times [2019-11-20 05:34:32,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:32,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1213617319] [2019-11-20 05:34:32,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:33,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:34:33,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:33,091 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:34:33,091 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:33,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:33,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:33,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:33,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 05:34:33,111 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 05:34:33,111 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:33,118 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 05:34:33,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1213617319] [2019-11-20 05:34:33,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:33,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 05:34:33,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842916479] [2019-11-20 05:34:33,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:34:33,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:34:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:34:33,120 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 3 states. [2019-11-20 05:34:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:33,191 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-11-20 05:34:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:34:33,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 05:34:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:33,195 INFO L225 Difference]: With dead ends: 59 [2019-11-20 05:34:33,195 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 05:34:33,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 05:34:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 05:34:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-20 05:34:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-20 05:34:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-11-20 05:34:33,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2019-11-20 05:34:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:33,201 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-11-20 05:34:33,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:34:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-11-20 05:34:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:34:33,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:33,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:33,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:33,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1447422976, now seen corresponding path program 1 times [2019-11-20 05:34:33,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:33,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1885676848] [2019-11-20 05:34:33,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:33,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:34:33,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:33,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:33,601 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 05:34:33,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:33,648 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 05:34:33,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:33,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-20 05:34:33,690 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 05:34:33,690 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:33,835 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 05:34:33,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885676848] [2019-11-20 05:34:33,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:33,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:34:33,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298977258] [2019-11-20 05:34:33,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 05:34:33,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 05:34:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:34:33,837 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 7 states. [2019-11-20 05:34:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:34,255 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-11-20 05:34:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:34:34,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-20 05:34:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:34,258 INFO L225 Difference]: With dead ends: 70 [2019-11-20 05:34:34,258 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 05:34:34,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:34:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 05:34:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-11-20 05:34:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 05:34:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-20 05:34:34,265 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-11-20 05:34:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:34,265 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-20 05:34:34,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 05:34:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-20 05:34:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 05:34:34,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:34,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:34,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:34,469 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 599518995, now seen corresponding path program 1 times [2019-11-20 05:34:34,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:34,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [722621467] [2019-11-20 05:34:34,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:34,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:34:34,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:34,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:34,641 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 05:34:34,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:34,670 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-20 05:34:34,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:34,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-11-20 05:34:34,684 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 05:34:34,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:34,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722621467] [2019-11-20 05:34:34,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:34,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 05:34:34,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845877715] [2019-11-20 05:34:34,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:34:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:34:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:34,790 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 6 states. [2019-11-20 05:34:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:35,050 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-20 05:34:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:34:35,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 05:34:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:35,052 INFO L225 Difference]: With dead ends: 67 [2019-11-20 05:34:35,052 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 05:34:35,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:34:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 05:34:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-11-20 05:34:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 05:34:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-11-20 05:34:35,059 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 14 [2019-11-20 05:34:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:35,059 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-11-20 05:34:35,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:34:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-11-20 05:34:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:34:35,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:35,060 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:35,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:35,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:35,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2133845019, now seen corresponding path program 1 times [2019-11-20 05:34:35,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:35,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [771773246] [2019-11-20 05:34:35,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:35,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 05:34:35,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:35,425 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_63|]} [2019-11-20 05:34:35,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:35,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:35,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:35,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:35,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:35,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:35,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:35,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:35,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 05:34:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:35,609 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:36,080 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 05:34:36,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:36,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:36,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:36,086 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 05:34:36,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:36,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-11-20 05:34:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:36,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [771773246] [2019-11-20 05:34:36,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:36,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 05:34:36,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539442724] [2019-11-20 05:34:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:34:36,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:34:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:34:36,092 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 10 states. [2019-11-20 05:34:37,104 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-20 05:34:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:37,669 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2019-11-20 05:34:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:34:37,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-20 05:34:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:37,672 INFO L225 Difference]: With dead ends: 124 [2019-11-20 05:34:37,672 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 05:34:37,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:34:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 05:34:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2019-11-20 05:34:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 05:34:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-11-20 05:34:37,681 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 15 [2019-11-20 05:34:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:37,682 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-11-20 05:34:37,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:34:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-11-20 05:34:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 05:34:37,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:37,683 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 05:34:37,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:37,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -145961679, now seen corresponding path program 1 times [2019-11-20 05:34:37,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:37,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1866553736] [2019-11-20 05:34:37,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:38,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:34:38,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:38,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:38,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-20 05:34:38,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:38,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:38,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:38,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-20 05:34:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:38,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866553736] [2019-11-20 05:34:38,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:38,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 05:34:38,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946486914] [2019-11-20 05:34:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:34:38,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:34:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:38,140 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 6 states. [2019-11-20 05:34:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:38,349 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-11-20 05:34:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:34:38,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 05:34:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:38,351 INFO L225 Difference]: With dead ends: 75 [2019-11-20 05:34:38,351 INFO L226 Difference]: Without dead ends: 75 [2019-11-20 05:34:38,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:34:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-20 05:34:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-20 05:34:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 05:34:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-11-20 05:34:38,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 18 [2019-11-20 05:34:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:38,358 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-11-20 05:34:38,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:34:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-11-20 05:34:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 05:34:38,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:38,360 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 05:34:38,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:38,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:38,565 INFO L82 PathProgramCache]: Analyzing trace with hash -145961678, now seen corresponding path program 1 times [2019-11-20 05:34:38,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:38,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1813837167] [2019-11-20 05:34:38,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:38,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 05:34:38,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:38,845 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 05:34:38,845 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:39,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:34:39,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 05:34:39,219 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 05:34:39,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 05:34:39,228 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:39,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 05:34:39,249 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:39,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:39,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 05:34:39,308 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-20 05:34:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:39,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813837167] [2019-11-20 05:34:39,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:39,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 05:34:39,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734023474] [2019-11-20 05:34:39,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 05:34:39,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 05:34:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-20 05:34:39,543 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 14 states. [2019-11-20 05:34:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:40,268 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2019-11-20 05:34:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:34:40,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-20 05:34:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:40,270 INFO L225 Difference]: With dead ends: 94 [2019-11-20 05:34:40,270 INFO L226 Difference]: Without dead ends: 94 [2019-11-20 05:34:40,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:34:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-20 05:34:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2019-11-20 05:34:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 05:34:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2019-11-20 05:34:40,277 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 18 [2019-11-20 05:34:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:40,277 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-11-20 05:34:40,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 05:34:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2019-11-20 05:34:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 05:34:40,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:40,279 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:40,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:40,482 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1452007619, now seen corresponding path program 1 times [2019-11-20 05:34:40,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:40,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1061762637] [2019-11-20 05:34:40,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:40,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:34:40,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:40,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:40,690 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 05:34:40,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:40,729 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 05:34:40,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:40,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 05:34:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:40,877 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:41,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1061762637] [2019-11-20 05:34:41,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:41,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 05:34:41,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215788183] [2019-11-20 05:34:41,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 05:34:41,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 05:34:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:34:41,578 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 12 states. [2019-11-20 05:34:42,554 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-20 05:34:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:43,131 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-11-20 05:34:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 05:34:43,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-20 05:34:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:43,133 INFO L225 Difference]: With dead ends: 94 [2019-11-20 05:34:43,133 INFO L226 Difference]: Without dead ends: 94 [2019-11-20 05:34:43,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:34:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-20 05:34:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2019-11-20 05:34:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 05:34:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-11-20 05:34:43,141 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 17 [2019-11-20 05:34:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:43,141 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-11-20 05:34:43,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 05:34:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-11-20 05:34:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:34:43,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:43,142 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] [2019-11-20 05:34:43,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:43,343 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1837428737, now seen corresponding path program 1 times [2019-11-20 05:34:43,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:43,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1260419346] [2019-11-20 05:34:43,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:34:43,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:43,529 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:34:43,529 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:43,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:43,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:43,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:43,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 05:34:43,590 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 05:34:43,590 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:43,635 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 05:34:43,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1260419346] [2019-11-20 05:34:43,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:43,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 7 [2019-11-20 05:34:43,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570022884] [2019-11-20 05:34:43,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:34:43,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:34:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:34:43,637 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 8 states. [2019-11-20 05:34:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:43,874 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-11-20 05:34:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:34:43,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 05:34:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:43,876 INFO L225 Difference]: With dead ends: 74 [2019-11-20 05:34:43,876 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 05:34:43,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:34:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 05:34:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-11-20 05:34:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 05:34:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2019-11-20 05:34:43,880 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 21 [2019-11-20 05:34:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2019-11-20 05:34:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:34:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2019-11-20 05:34:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:34:43,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:43,882 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] [2019-11-20 05:34:44,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:44,085 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1837428736, now seen corresponding path program 1 times [2019-11-20 05:34:44,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:44,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1801810596] [2019-11-20 05:34:44,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/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 05:34:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:44,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 05:34:44,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:44,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:44,321 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 05:34:44,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:44,349 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 05:34:44,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:44,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 05:34:44,422 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 05:34:44,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:44,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801810596] [2019-11-20 05:34:44,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:44,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 05:34:44,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280523319] [2019-11-20 05:34:44,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 05:34:44,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 05:34:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 05:34:44,784 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 14 states. [2019-11-20 05:34:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:46,121 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2019-11-20 05:34:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 05:34:46,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 05:34:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:46,126 INFO L225 Difference]: With dead ends: 102 [2019-11-20 05:34:46,126 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 05:34:46,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:34:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 05:34:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-20 05:34:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 05:34:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-11-20 05:34:46,130 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 21 [2019-11-20 05:34:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:46,130 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-11-20 05:34:46,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 05:34:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-11-20 05:34:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:34:46,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:46,140 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:46,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:46,343 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 544108577, now seen corresponding path program 2 times [2019-11-20 05:34:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1521843979] [2019-11-20 05:34:46,344 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:46,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:34:46,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:46,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 05:34:46,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:46,571 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_88|]} [2019-11-20 05:34:46,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:34:46,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:34:46,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:46,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:46,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:46,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:46,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:46,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:46,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 05:34:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:46,830 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:47,702 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 05:34:47,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:34:47,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:47,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:47,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:34:47,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:47,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:47,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:47,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:10 [2019-11-20 05:34:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:47,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521843979] [2019-11-20 05:34:47,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:47,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-20 05:34:47,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010189978] [2019-11-20 05:34:47,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:34:47,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:34:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:34:47,834 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 15 states. [2019-11-20 05:34:49,785 WARN L191 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-20 05:34:52,734 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 05:34:53,512 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 05:34:55,937 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 05:34:56,390 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-20 05:34:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:57,279 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2019-11-20 05:34:57,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 05:34:57,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-20 05:34:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:57,288 INFO L225 Difference]: With dead ends: 206 [2019-11-20 05:34:57,288 INFO L226 Difference]: Without dead ends: 206 [2019-11-20 05:34:57,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-11-20 05:34:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-20 05:34:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 115. [2019-11-20 05:34:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 05:34:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2019-11-20 05:34:57,307 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 23 [2019-11-20 05:34:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:57,307 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2019-11-20 05:34:57,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:34:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2019-11-20 05:34:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:34:57,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:57,317 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:34:57,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:57,520 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 291331133, now seen corresponding path program 1 times [2019-11-20 05:34:57,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:57,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [152728671] [2019-11-20 05:34:57,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:57,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 05:34:57,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:57,804 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 12 treesize of output 8 [2019-11-20 05:34:57,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:57,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:57,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:57,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 05:34:57,910 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 05:34:57,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:57,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:57,913 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 05:34:57,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 05:34:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:57,943 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:58,058 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 15 [2019-11-20 05:34:58,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 05:34:58,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:58,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:58,072 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:58,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:58,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:58,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 05:34:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:58,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152728671] [2019-11-20 05:34:58,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:58,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 16 [2019-11-20 05:34:58,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810009534] [2019-11-20 05:34:58,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 05:34:58,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 05:34:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:34:58,084 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand 16 states. [2019-11-20 05:34:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:58,515 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2019-11-20 05:34:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:34:58,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 05:34:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:58,517 INFO L225 Difference]: With dead ends: 133 [2019-11-20 05:34:58,517 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 05:34:58,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:34:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 05:34:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-20 05:34:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 05:34:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2019-11-20 05:34:58,522 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 26 [2019-11-20 05:34:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:58,523 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2019-11-20 05:34:58,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 05:34:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2019-11-20 05:34:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:34:58,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:58,525 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:34:58,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:58,728 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:34:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1397612609, now seen corresponding path program 1 times [2019-11-20 05:34:58,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:34:58,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [911532660] [2019-11-20 05:34:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:34:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:58,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 05:34:58,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:59,019 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 15 treesize of output 11 [2019-11-20 05:34:59,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:59,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:59,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:34:59,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-20 05:34:59,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:34:59,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:59,233 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 19 treesize of output 12 [2019-11-20 05:34:59,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:59,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:59,248 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 05:34:59,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-11-20 05:34:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:59,302 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:34:59,592 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 15 [2019-11-20 05:34:59,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 05:34:59,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:59,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:59,598 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:59,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:34:59,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:59,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 05:34:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:59,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [911532660] [2019-11-20 05:34:59,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:59,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 21 [2019-11-20 05:34:59,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644483988] [2019-11-20 05:34:59,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 05:34:59,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:34:59,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 05:34:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-20 05:34:59,770 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 21 states. [2019-11-20 05:35:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:01,301 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2019-11-20 05:35:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 05:35:01,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2019-11-20 05:35:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:01,305 INFO L225 Difference]: With dead ends: 151 [2019-11-20 05:35:01,306 INFO L226 Difference]: Without dead ends: 151 [2019-11-20 05:35:01,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2019-11-20 05:35:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-20 05:35:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2019-11-20 05:35:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 05:35:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2019-11-20 05:35:01,312 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 26 [2019-11-20 05:35:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:01,312 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2019-11-20 05:35:01,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 05:35:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2019-11-20 05:35:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:35:01,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:01,313 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] [2019-11-20 05:35:01,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:01,514 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:35:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 746415946, now seen corresponding path program 1 times [2019-11-20 05:35:01,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:35:01,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1663124983] [2019-11-20 05:35:01,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:01,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:35:01,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:01,753 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 05:35:01,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:01,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:01,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:01,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:35:01,845 INFO L343 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2019-11-20 05:35:01,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 49 [2019-11-20 05:35:01,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:01,868 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-20 05:35:01,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,869 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 05:35:01,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-11-20 05:35:01,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:01,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:02,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:02,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:02,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:02,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:35:04,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:35:12,231 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 05:35:12,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663124983] [2019-11-20 05:35:12,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:12,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-20 05:35:12,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783025951] [2019-11-20 05:35:12,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:35:12,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:35:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:35:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=58, Unknown=5, NotChecked=0, Total=90 [2019-11-20 05:35:12,233 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2019-11-20 05:35:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:28,582 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-11-20 05:35:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:35:28,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-20 05:35:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:28,584 INFO L225 Difference]: With dead ends: 129 [2019-11-20 05:35:28,584 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 05:35:28,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=40, Invalid=87, Unknown=5, NotChecked=0, Total=132 [2019-11-20 05:35:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 05:35:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 05:35:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 05:35:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-20 05:35:28,588 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 28 [2019-11-20 05:35:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:28,588 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-20 05:35:28,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:35:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-20 05:35:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 05:35:28,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:28,589 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:35:28,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:28,793 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:35:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -467900452, now seen corresponding path program 1 times [2019-11-20 05:35:28,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:35:28,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1081099729] [2019-11-20 05:35:28,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:29,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 05:35:29,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:29,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:35:29,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 05:35:29,087 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 12 treesize of output 8 [2019-11-20 05:35:29,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-20 05:35:29,114 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 24 treesize of output 23 [2019-11-20 05:35:29,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:29,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-11-20 05:35:29,338 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 28 treesize of output 13 [2019-11-20 05:35:29,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-11-20 05:35:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:35:29,428 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:35:29,728 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 15 [2019-11-20 05:35:29,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 05:35:29,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,737 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:29,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:29,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 05:35:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:35:29,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081099729] [2019-11-20 05:35:29,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:29,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 17 [2019-11-20 05:35:29,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314481537] [2019-11-20 05:35:29,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 05:35:29,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:35:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 05:35:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:35:29,749 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 17 states. [2019-11-20 05:35:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:30,828 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2019-11-20 05:35:30,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:35:30,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-20 05:35:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:30,830 INFO L225 Difference]: With dead ends: 129 [2019-11-20 05:35:30,830 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 05:35:30,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-20 05:35:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 05:35:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-20 05:35:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 05:35:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2019-11-20 05:35:30,835 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 30 [2019-11-20 05:35:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:30,836 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2019-11-20 05:35:30,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 05:35:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2019-11-20 05:35:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 05:35:30,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:30,837 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:35:31,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:31,037 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:35:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash -467898274, now seen corresponding path program 1 times [2019-11-20 05:35:31,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:35:31,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1557978276] [2019-11-20 05:35:31,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:31,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:35:31,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:31,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:31,299 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 05:35:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:31,338 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 05:35:31,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:31,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 05:35:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:35:31,735 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:35:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:35:33,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1557978276] [2019-11-20 05:35:33,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:35:33,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-20 05:35:33,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695059302] [2019-11-20 05:35:33,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 05:35:33,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:35:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 05:35:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:35:33,158 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 23 states. [2019-11-20 05:35:36,305 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 05:35:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:37,198 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2019-11-20 05:35:37,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 05:35:37,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-11-20 05:35:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:37,201 INFO L225 Difference]: With dead ends: 204 [2019-11-20 05:35:37,202 INFO L226 Difference]: Without dead ends: 204 [2019-11-20 05:35:37,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 05:35:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-20 05:35:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 136. [2019-11-20 05:35:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 05:35:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2019-11-20 05:35:37,207 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 30 [2019-11-20 05:35:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:37,208 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2019-11-20 05:35:37,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 05:35:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2019-11-20 05:35:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 05:35:37,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:37,209 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:35:37,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:37,409 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:35:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash -601913958, now seen corresponding path program 1 times [2019-11-20 05:35:37,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:35:37,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [289823480] [2019-11-20 05:35:37,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:37,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 05:35:37,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:37,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:35:37,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:37,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:37,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:37,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 05:35:37,721 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 15 treesize of output 11 [2019-11-20 05:35:37,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:37,791 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-20 05:35:37,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:37,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2019-11-20 05:35:37,829 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 26 treesize of output 25 [2019-11-20 05:35:37,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:37,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:37,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:37,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2019-11-20 05:35:38,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:38,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 05:35:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:38,130 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 05:35:38,197 INFO L567 ElimStorePlain]: treesize reduction 5, result has 87.2 percent of original size [2019-11-20 05:35:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:38,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:38,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:30 [2019-11-20 05:35:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:38,745 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-11-20 05:35:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:35:40,774 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:35:42,603 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 05:35:43,035 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 05:35:44,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:44,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-11-20 05:35:44,263 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 05:35:44,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2019-11-20 05:35:44,291 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:44,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2019-11-20 05:35:44,333 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:44,726 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 05:35:44,726 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.0 percent of original size [2019-11-20 05:35:44,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-11-20 05:35:44,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 05:35:44,781 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 05:35:44,980 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-11-20 05:35:44,980 INFO L567 ElimStorePlain]: treesize reduction 17, result has 75.4 percent of original size [2019-11-20 05:35:44,980 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:45,005 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 50 treesize of output 48 [2019-11-20 05:35:45,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:35:45,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:35:45,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-11-20 05:35:45,042 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:45,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:45,109 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:45,138 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 52 treesize of output 50 [2019-11-20 05:35:45,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 05:35:45,201 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 05:35:45,368 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-20 05:35:45,369 INFO L567 ElimStorePlain]: treesize reduction 17, result has 73.8 percent of original size [2019-11-20 05:35:45,369 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:45,596 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 05:35:45,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:45,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 05:35:45,604 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:185, output treesize:105 [2019-11-20 05:35:46,263 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-20 05:35:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:35:46,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [289823480] [2019-11-20 05:35:46,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:35:46,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-20 05:35:46,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149839875] [2019-11-20 05:35:46,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 05:35:46,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:35:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 05:35:46,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-20 05:35:46,305 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand 24 states. [2019-11-20 05:35:46,690 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-11-20 05:35:47,959 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-20 05:35:48,343 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 05:35:48,688 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 05:35:49,035 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 05:35:51,082 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-11-20 05:35:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:52,206 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2019-11-20 05:35:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 05:35:52,208 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-20 05:35:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:52,209 INFO L225 Difference]: With dead ends: 153 [2019-11-20 05:35:52,209 INFO L226 Difference]: Without dead ends: 153 [2019-11-20 05:35:52,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 05:35:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-20 05:35:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-20 05:35:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 05:35:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2019-11-20 05:35:52,213 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 30 [2019-11-20 05:35:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:52,214 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2019-11-20 05:35:52,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 05:35:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2019-11-20 05:35:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:35:52,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:52,215 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 05:35:52,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:52,422 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-20 05:35:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 234852129, now seen corresponding path program 2 times [2019-11-20 05:35:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:35:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [984567499] [2019-11-20 05:35:52,423 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05d6d309-e97d-4eeb-8ee7-b026d8427f53/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:52,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:35:52,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:35:52,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 05:35:52,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:52,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 05:35:52,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:52,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-20 05:35:52,830 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 12 treesize of output 8 [2019-11-20 05:35:52,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:52,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-20 05:35:52,883 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 24 treesize of output 23 [2019-11-20 05:35:52,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,926 INFO L567 ElimStorePlain]: treesize reduction 6, result has 87.2 percent of original size [2019-11-20 05:35:52,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:52,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:41 [2019-11-20 05:35:53,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:35:53,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-20 05:35:53,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:53,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:53,365 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 05:35:53,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:5 [2019-11-20 05:35:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:35:53,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:35:53,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:53,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2019-11-20 05:35:53,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:53,901 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 32 treesize of output 36 [2019-11-20 05:35:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:53,910 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_46], 1=[v_arrayElimCell_47]} [2019-11-20 05:35:54,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:35:54,114 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 05:35:54,117 INFO L168 Benchmark]: Toolchain (without parser) took 87414.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 209.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:35:54,118 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:35:54,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:35:54,118 INFO L168 Benchmark]: Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:35:54,118 INFO L168 Benchmark]: RCFGBuilder took 794.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:35:54,119 INFO L168 Benchmark]: TraceAbstraction took 85966.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.6 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:35:54,120 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.65 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 572.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85966.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.6 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...