./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-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_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 04:46:23,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:46:23,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:46:23,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:46:23,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:46:23,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:46:23,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:46:23,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:46:23,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:46:23,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:46:23,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:46:23,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:46:23,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:46:23,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:46:23,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:46:23,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:46:23,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:46:23,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:46:23,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:46:23,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:46:23,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:46:23,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:46:23,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:46:23,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:46:23,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:46:23,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:46:23,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:46:23,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:46:23,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:46:23,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:46:23,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:46:23,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:46:23,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:46:23,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:46:23,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:46:23,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:46:23,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:46:23,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:46:23,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:46:23,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:46:23,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:46:23,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 04:46:23,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:46:23,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:46:23,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:46:23,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:46:23,569 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:46:23,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:46:23,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:46:23,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 04:46:23,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:46:23,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:46:23,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:46:23,570 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 04:46:23,571 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 04:46:23,571 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 04:46:23,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:46:23,571 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:46:23,571 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:46:23,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:46:23,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:46:23,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:46:23,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:46:23,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:46:23,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:46:23,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:46:23,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:46:23,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:46:23,574 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:46:23,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:46:23,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:46:23,574 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_89e729a6-1293-410b-921e-9e7740cf1b29/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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc [2019-11-20 04:46:23,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:46:23,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:46:23,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:46:23,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:46:23,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:46:23,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-20 04:46:23,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/data/d0cea7108/6af32baf4eee4c49a19ea239a0e48086/FLAGdeaba78e6 [2019-11-20 04:46:24,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:46:24,235 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-20 04:46:24,246 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/data/d0cea7108/6af32baf4eee4c49a19ea239a0e48086/FLAGdeaba78e6 [2019-11-20 04:46:24,576 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/bin/uautomizer/data/d0cea7108/6af32baf4eee4c49a19ea239a0e48086 [2019-11-20 04:46:24,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:46:24,579 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 04:46:24,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:46:24,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:46:24,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:46:24,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:46:24" (1/1) ... [2019-11-20 04:46:24,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375ee2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:24, skipping insertion in model container [2019-11-20 04:46:24,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:46:24" (1/1) ... [2019-11-20 04:46:24,593 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:46:24,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:46:25,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:46:25,045 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:46:25,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:46:25,173 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:46:25,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25 WrapperNode [2019-11-20 04:46:25,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:46:25,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:46:25,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:46:25,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:46:25,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... [2019-11-20 04:46:25,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:46:25,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:46:25,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:46:25,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:46:25,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:25,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 04:46:25,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:46:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 04:46:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 04:46:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-11-20 04:46:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 04:46:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-11-20 04:46:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 04:46:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 04:46:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 04:46:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 04:46:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 04:46:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 04:46:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 04:46:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 04:46:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 04:46:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 04:46:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 04:46:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 04:46:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 04:46:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 04:46:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 04:46:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 04:46:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 04:46:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 04:46:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 04:46:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 04:46:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 04:46:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 04:46:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 04:46:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 04:46:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 04:46:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 04:46:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 04:46:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 04:46:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 04:46:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 04:46:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 04:46:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 04:46:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 04:46:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 04:46:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 04:46:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 04:46:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 04:46:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 04:46:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 04:46:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 04:46:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 04:46:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 04:46:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 04:46:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 04:46:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 04:46:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 04:46:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 04:46:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 04:46:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 04:46:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 04:46:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 04:46:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 04:46:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 04:46:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 04:46:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 04:46:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 04:46:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 04:46:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 04:46:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 04:46:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 04:46:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 04:46:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 04:46:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 04:46:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 04:46:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 04:46:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 04:46:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-11-20 04:46:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:46:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:46:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 04:46:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:46:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 04:46:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:46:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:46:25,946 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:46:25,946 INFO L285 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-20 04:46:25,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:46:25 BoogieIcfgContainer [2019-11-20 04:46:25,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:46:25,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:46:25,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:46:25,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:46:25,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:46:24" (1/3) ... [2019-11-20 04:46:25,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4504a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:46:25, skipping insertion in model container [2019-11-20 04:46:25,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:46:25" (2/3) ... [2019-11-20 04:46:25,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4504a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:46:25, skipping insertion in model container [2019-11-20 04:46:25,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:46:25" (3/3) ... [2019-11-20 04:46:25,954 INFO L109 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2019-11-20 04:46:25,963 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:46:25,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-20 04:46:25,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-20 04:46:25,999 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:46:26,000 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 04:46:26,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:46:26,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:46:26,000 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:46:26,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:46:26,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:46:26,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:46:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-20 04:46:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 04:46:26,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:26,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:26,025 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-11-20 04:46:26,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:26,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1696846617] [2019-11-20 04:46:26,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:26,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:46:26,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:26,322 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 04:46:26,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:26,332 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 04:46:26,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1696846617] [2019-11-20 04:46:26,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:26,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 04:46:26,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368774885] [2019-11-20 04:46:26,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:46:26,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:46:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:46:26,350 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-20 04:46:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:26,516 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-20 04:46:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:46:26,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-20 04:46:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:26,533 INFO L225 Difference]: With dead ends: 56 [2019-11-20 04:46:26,534 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 04:46:26,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 04:46:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 04:46:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-11-20 04:46:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 04:46:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-20 04:46:26,600 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-11-20 04:46:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:26,601 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-20 04:46:26,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:46:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-20 04:46:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 04:46:26,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:26,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:26,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:26,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-11-20 04:46:26,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:26,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [940521710] [2019-11-20 04:46:26,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:27,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:46:27,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:27,041 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_40|]} [2019-11-20 04:46:27,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:46:27,060 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 13 treesize of output 15 [2019-11-20 04:46:27,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:27,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:27,087 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 18 treesize of output 12 [2019-11-20 04:46:27,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:27,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:27,112 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 18 treesize of output 10 [2019-11-20 04:46:27,113 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 04:46:27,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:27,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:46:27,140 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-20 04:46:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:46:27,167 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:27,233 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 04:46:27,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940521710] [2019-11-20 04:46:27,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:27,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 04:46:27,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232037842] [2019-11-20 04:46:27,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:46:27,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:46:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:46:27,237 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-20 04:46:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:27,405 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-20 04:46:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:46:27,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-20 04:46:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:27,407 INFO L225 Difference]: With dead ends: 43 [2019-11-20 04:46:27,407 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 04:46:27,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 04:46:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 04:46:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 04:46:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 04:46:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-20 04:46:27,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-11-20 04:46:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:27,416 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-20 04:46:27,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:46:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-20 04:46:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 04:46:27,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:27,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:27,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:27,621 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-11-20 04:46:27,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:27,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [396052992] [2019-11-20 04:46:27,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:27,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:46:27,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:27,858 INFO L343 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2019-11-20 04:46:27,858 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 13 treesize of output 15 [2019-11-20 04:46:27,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:27,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:27,872 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 9 treesize of output 5 [2019-11-20 04:46:27,873 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 04:46:27,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:27,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:46:27,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:11 [2019-11-20 04:46:27,900 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 04:46:27,900 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:27,914 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 04:46:27,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [396052992] [2019-11-20 04:46:27,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:27,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 04:46:27,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478951231] [2019-11-20 04:46:27,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:46:27,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:46:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:46:27,916 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-11-20 04:46:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:28,000 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-20 04:46:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:46:28,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-20 04:46:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:28,003 INFO L225 Difference]: With dead ends: 42 [2019-11-20 04:46:28,003 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 04:46:28,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 04:46:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 04:46:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 04:46:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 04:46:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-20 04:46:28,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-20 04:46:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:28,009 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-20 04:46:28,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:46:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-20 04:46:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 04:46:28,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:28,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:28,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:28,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-11-20 04:46:28,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:28,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [475435808] [2019-11-20 04:46:28,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:28,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 04:46:28,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:28,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:46:28,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:28,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:28,439 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 04:46:28,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-20 04:46:28,451 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 04:46:28,451 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:46:28,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [475435808] [2019-11-20 04:46:28,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:28,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 04:46:28,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408432143] [2019-11-20 04:46:28,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:46:28,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:46:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:46:28,464 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-20 04:46:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:28,532 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-20 04:46:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:46:28,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 04:46:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:28,535 INFO L225 Difference]: With dead ends: 42 [2019-11-20 04:46:28,535 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 04:46:28,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:46:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 04:46:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 04:46:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 04:46:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-20 04:46:28,540 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 10 [2019-11-20 04:46:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:28,541 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-20 04:46:28,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:46:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-20 04:46:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 04:46:28,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:28,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:28,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:28,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-11-20 04:46:28,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:28,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2021682945] [2019-11-20 04:46:28,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:28,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:46:28,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:28,994 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 04:46:28,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:29,013 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 04:46:29,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2021682945] [2019-11-20 04:46:29,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:29,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 04:46:29,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743136794] [2019-11-20 04:46:29,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:46:29,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:46:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:46:29,015 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2019-11-20 04:46:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:29,254 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-20 04:46:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:46:29,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-20 04:46:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:29,260 INFO L225 Difference]: With dead ends: 53 [2019-11-20 04:46:29,260 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 04:46:29,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:46:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 04:46:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-20 04:46:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 04:46:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-20 04:46:29,266 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-11-20 04:46:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:29,267 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-20 04:46:29,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:46:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-20 04:46:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 04:46:29,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:29,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:29,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:29,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-11-20 04:46:29,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:29,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1447541265] [2019-11-20 04:46:29,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:29,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:46:29,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:29,718 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 04:46:29,719 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:46:29,859 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 04:46:29,860 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 04:46:29,868 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 04:46:29,868 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 04:46:29,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:29,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 04:46:29,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 04:46:29,964 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 04:46:29,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1447541265] [2019-11-20 04:46:29,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:29,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 04:46:29,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998993395] [2019-11-20 04:46:29,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:46:29,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:46:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:46:29,965 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2019-11-20 04:46:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:30,313 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-20 04:46:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:46:30,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-20 04:46:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:30,315 INFO L225 Difference]: With dead ends: 50 [2019-11-20 04:46:30,315 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 04:46:30,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:46:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 04:46:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-20 04:46:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 04:46:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-20 04:46:30,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2019-11-20 04:46:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:30,321 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-20 04:46:30,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:46:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-20 04:46:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:46:30,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:30,322 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 04:46:30,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:30,526 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-11-20 04:46:30,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:30,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [178749791] [2019-11-20 04:46:30,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:30,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:46:30,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:30,801 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 04:46:30,802 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:30,885 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 04:46:30,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [178749791] [2019-11-20 04:46:30,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:30,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 04:46:30,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115047370] [2019-11-20 04:46:30,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:46:30,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:46:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:46:30,887 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 10 states. [2019-11-20 04:46:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:31,010 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-20 04:46:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:46:31,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-20 04:46:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:31,015 INFO L225 Difference]: With dead ends: 41 [2019-11-20 04:46:31,015 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 04:46:31,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:46:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 04:46:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-20 04:46:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 04:46:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-20 04:46:31,019 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2019-11-20 04:46:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:31,020 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-20 04:46:31,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:46:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-20 04:46:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:46:31,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:31,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:31,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:31,221 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-11-20 04:46:31,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:31,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [224216742] [2019-11-20 04:46:31,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:31,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 04:46:31,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:31,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:46:31,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:31,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:31,451 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 04:46:31,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-20 04:46:31,467 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 04:46:31,467 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:31,535 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 04:46:31,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [224216742] [2019-11-20 04:46:31,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:31,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-20 04:46:31,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302735127] [2019-11-20 04:46:31,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:46:31,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:31,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:46:31,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:46:31,537 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-11-20 04:46:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:31,766 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-20 04:46:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:46:31,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 04:46:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:31,768 INFO L225 Difference]: With dead ends: 46 [2019-11-20 04:46:31,768 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 04:46:31,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:46:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 04:46:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-20 04:46:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 04:46:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-20 04:46:31,773 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-11-20 04:46:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:31,773 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-20 04:46:31,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:46:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-20 04:46:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:46:31,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:31,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:31,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:31,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695808, now seen corresponding path program 1 times [2019-11-20 04:46:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:31,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1438276923] [2019-11-20 04:46:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:32,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:46:32,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:32,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:32,210 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 04:46:32,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:32,237 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 04:46:32,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:46:32,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-20 04:46:32,258 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 04:46:32,258 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:32,278 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 04:46:32,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1438276923] [2019-11-20 04:46:32,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:32,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 04:46:32,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855543308] [2019-11-20 04:46:32,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:46:32,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:46:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:46:32,280 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-11-20 04:46:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:32,394 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-20 04:46:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:46:32,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-20 04:46:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:32,395 INFO L225 Difference]: With dead ends: 44 [2019-11-20 04:46:32,395 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 04:46:32,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:46:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 04:46:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-20 04:46:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 04:46:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-20 04:46:32,400 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-11-20 04:46:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:32,400 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-20 04:46:32,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:46:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-20 04:46:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:46:32,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:32,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:32,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:32,606 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-11-20 04:46:32,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:32,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1666332182] [2019-11-20 04:46:32,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:32,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 04:46:32,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:32,817 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 04:46:32,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:32,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:32,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:46:32,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-20 04:46:32,878 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 04:46:32,878 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:33,356 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 04:46:33,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1666332182] [2019-11-20 04:46:33,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:33,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 04:46:33,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26797848] [2019-11-20 04:46:33,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 04:46:33,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:33,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 04:46:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:46:33,358 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2019-11-20 04:46:33,920 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-20 04:46:34,469 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-20 04:46:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:34,899 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-20 04:46:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 04:46:34,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-20 04:46:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:34,902 INFO L225 Difference]: With dead ends: 131 [2019-11-20 04:46:34,902 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 04:46:34,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:46:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 04:46:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2019-11-20 04:46:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:46:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-11-20 04:46:34,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 20 [2019-11-20 04:46:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:34,911 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-11-20 04:46:34,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 04:46:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-11-20 04:46:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:46:34,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:34,913 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 04:46:35,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:35,116 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-11-20 04:46:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:35,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1616647577] [2019-11-20 04:46:35,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:35,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 04:46:35,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:35,342 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 18 treesize of output 12 [2019-11-20 04:46:35,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:35,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 04:46:35,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:46:35,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:35,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-20 04:46:35,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:35,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2019-11-20 04:46:35,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,517 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-20 04:46:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:46:35,518 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 04:46:35,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-20 04:46:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:46:35,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:46:35,596 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 04:46:35,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:46:35,767 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 04:46:35,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,770 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 15 treesize of output 13 [2019-11-20 04:46:35,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:35,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:46:35,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:8 [2019-11-20 04:46:35,805 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 04:46:35,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616647577] [2019-11-20 04:46:35,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:35,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2019-11-20 04:46:35,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321876862] [2019-11-20 04:46:35,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:46:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:46:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:46:35,807 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2019-11-20 04:46:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:46:37,099 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-20 04:46:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:46:37,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-20 04:46:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:46:37,101 INFO L225 Difference]: With dead ends: 77 [2019-11-20 04:46:37,101 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 04:46:37,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:46:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 04:46:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-11-20 04:46:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:46:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-20 04:46:37,110 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-11-20 04:46:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:46:37,110 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-20 04:46:37,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:46:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-20 04:46:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:46:37,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:46:37,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:46:37,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:46:37,312 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:46:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:46:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-11-20 04:46:37,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:46:37,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1018445032] [2019-11-20 04:46:37,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:46:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:46:37,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 04:46:37,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:46:37,605 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_109|]} [2019-11-20 04:46:37,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:46:37,613 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 13 treesize of output 15 [2019-11-20 04:46:37,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:37,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:37,636 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 18 treesize of output 12 [2019-11-20 04:46:37,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:37,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:37,657 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 18 treesize of output 10 [2019-11-20 04:46:37,658 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 04:46:37,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:37,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:46:37,672 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-20 04:46:37,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:46:37,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 52 [2019-11-20 04:46:37,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:46:38,046 INFO L567 ElimStorePlain]: treesize reduction 28, result has 45.1 percent of original size [2019-11-20 04:46:38,047 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 04:46:38,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-20 04:46:38,188 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 04:46:38,189 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:46:38,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:46:40,549 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 04:46:46,701 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 04:46:47,259 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 04:46:47,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1018445032] [2019-11-20 04:46:47,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:46:47,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-11-20 04:46:47,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913253716] [2019-11-20 04:46:47,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 04:46:47,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:46:47,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 04:46:47,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=313, Unknown=2, NotChecked=0, Total=380 [2019-11-20 04:46:47,261 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 20 states. [2019-11-20 04:47:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:05,498 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2019-11-20 04:47:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 04:47:05,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-11-20 04:47:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:05,500 INFO L225 Difference]: With dead ends: 77 [2019-11-20 04:47:05,501 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 04:47:05,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=103, Invalid=447, Unknown=2, NotChecked=0, Total=552 [2019-11-20 04:47:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 04:47:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-11-20 04:47:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:47:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-11-20 04:47:05,506 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 21 [2019-11-20 04:47:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:05,506 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-11-20 04:47:05,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 04:47:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-11-20 04:47:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 04:47:05,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:05,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:05,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:05,707 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-11-20 04:47:05,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:05,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1229027699] [2019-11-20 04:47:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:05,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 04:47:05,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:05,921 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 04:47:05,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:05,985 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 04:47:05,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1229027699] [2019-11-20 04:47:05,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:47:05,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 04:47:05,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076165834] [2019-11-20 04:47:05,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:47:05,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:05,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:47:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:47:05,987 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2019-11-20 04:47:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:06,084 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-20 04:47:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:47:06,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-20 04:47:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:06,087 INFO L225 Difference]: With dead ends: 68 [2019-11-20 04:47:06,087 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 04:47:06,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:47:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 04:47:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 04:47:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:47:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-11-20 04:47:06,091 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 23 [2019-11-20 04:47:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:06,091 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-11-20 04:47:06,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:47:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-11-20 04:47:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 04:47:06,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:06,092 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] [2019-11-20 04:47:06,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:06,302 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-11-20 04:47:06,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:06,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [412460443] [2019-11-20 04:47:06,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:06,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:47:06,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:06,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 04:47:06,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:06,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-20 04:47:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:06,571 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:06,615 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 04:47:06,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:06,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-20 04:47:06,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:06,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-11-20 04:47:06,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:06,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:06,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:06,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-11-20 04:47:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:06,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [412460443] [2019-11-20 04:47:06,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:06,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:47:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781790325] [2019-11-20 04:47:06,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:47:06,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:47:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:47:06,646 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 5 states. [2019-11-20 04:47:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:06,746 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-20 04:47:06,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:47:06,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-20 04:47:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:06,748 INFO L225 Difference]: With dead ends: 67 [2019-11-20 04:47:06,748 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 04:47:06,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:47:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 04:47:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-20 04:47:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-20 04:47:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-11-20 04:47:06,752 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 27 [2019-11-20 04:47:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:06,752 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-11-20 04:47:06,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:47:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-11-20 04:47:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 04:47:06,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:06,753 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] [2019-11-20 04:47:06,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:06,960 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357336, now seen corresponding path program 1 times [2019-11-20 04:47:06,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:06,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978413400] [2019-11-20 04:47:06,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:07,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:47:07,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:07,226 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:07,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:47:07,320 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 04:47:07,320 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 04:47:07,329 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 04:47:07,329 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 04:47:07,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:07,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 04:47:07,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 04:47:07,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:07,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-20 04:47:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,480 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:47:07,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:07,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:47:07,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 04:47:07,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:07,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:08,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:08,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:08,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978413400] [2019-11-20 04:47:08,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:08,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 04:47:08,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526723259] [2019-11-20 04:47:08,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:47:08,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:47:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:47:08,372 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 10 states. [2019-11-20 04:47:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:08,536 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-11-20 04:47:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:47:08,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-20 04:47:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:08,538 INFO L225 Difference]: With dead ends: 66 [2019-11-20 04:47:08,538 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 04:47:08,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:47:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 04:47:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 04:47:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 04:47:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-11-20 04:47:08,542 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2019-11-20 04:47:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:08,543 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-11-20 04:47:08,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:47:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-11-20 04:47:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 04:47:08,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:08,544 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 04:47:08,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:08,746 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-11-20 04:47:08,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:08,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1007714473] [2019-11-20 04:47:08,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:08,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:47:08,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:09,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 04:47:09,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:09,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:09,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:09,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-20 04:47:09,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:47:09,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:09,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:09,033 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 04:47:09,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 04:47:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:09,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:09,131 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 28 treesize of output 24 [2019-11-20 04:47:09,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 04:47:09,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:09,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 04:47:09,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-20 04:47:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:09,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1007714473] [2019-11-20 04:47:09,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:09,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-20 04:47:09,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555530129] [2019-11-20 04:47:09,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 04:47:09,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 04:47:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:47:09,169 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2019-11-20 04:47:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:09,450 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-20 04:47:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:47:09,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-20 04:47:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:09,451 INFO L225 Difference]: With dead ends: 65 [2019-11-20 04:47:09,451 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 04:47:09,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-20 04:47:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 04:47:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-20 04:47:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 04:47:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-20 04:47:09,456 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2019-11-20 04:47:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:09,456 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-20 04:47:09,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 04:47:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-20 04:47:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 04:47:09,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:09,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:09,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:09,657 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-11-20 04:47:09,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:09,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1872616159] [2019-11-20 04:47:09,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:09,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 04:47:09,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:09,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 04:47:09,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:09,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:09,976 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 04:47:09,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-20 04:47:10,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:47:10,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:10,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:10,033 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 04:47:10,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 04:47:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:10,061 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:10,226 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 28 treesize of output 24 [2019-11-20 04:47:10,226 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 04:47:10,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:10,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:47:10,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-20 04:47:10,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:47:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:47:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:10,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872616159] [2019-11-20 04:47:10,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:10,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-20 04:47:10,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197361881] [2019-11-20 04:47:10,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 04:47:10,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 04:47:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-20 04:47:10,631 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 18 states. [2019-11-20 04:47:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:11,250 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-11-20 04:47:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 04:47:11,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-20 04:47:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:11,251 INFO L225 Difference]: With dead ends: 64 [2019-11-20 04:47:11,251 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 04:47:11,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:47:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 04:47:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 04:47:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 04:47:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-20 04:47:11,255 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 29 [2019-11-20 04:47:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:11,255 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-20 04:47:11,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 04:47:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-20 04:47:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 04:47:11,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:11,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:11,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:11,456 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:11,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-11-20 04:47:11,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:11,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1750021284] [2019-11-20 04:47:11,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:11,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 04:47:11,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:11,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 04:47:11,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:11,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 04:47:11,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:11,735 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 04:47:11,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,750 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 04:47:11,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-20 04:47:11,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 04:47:11,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:11,813 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 04:47:11,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 04:47:11,842 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 04:47:11,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:11,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:11,844 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 04:47:11,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-20 04:47:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:11,856 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:11,973 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 36 treesize of output 32 [2019-11-20 04:47:11,974 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 04:47:11,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:11,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:47:11,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-20 04:47:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:12,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750021284] [2019-11-20 04:47:12,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:12,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-20 04:47:12,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572082934] [2019-11-20 04:47:12,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 04:47:12,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 04:47:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:47:12,176 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 13 states. [2019-11-20 04:47:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:12,596 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2019-11-20 04:47:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:47:12,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-20 04:47:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:12,598 INFO L225 Difference]: With dead ends: 63 [2019-11-20 04:47:12,598 INFO L226 Difference]: Without dead ends: 63 [2019-11-20 04:47:12,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:47:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-20 04:47:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-20 04:47:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 04:47:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-20 04:47:12,601 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 30 [2019-11-20 04:47:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:12,601 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-20 04:47:12,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 04:47:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-20 04:47:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 04:47:12,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:12,602 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:12,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:12,803 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-11-20 04:47:12,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:12,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1862836811] [2019-11-20 04:47:12,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:13,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:47:13,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:13,043 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 11 treesize of output 7 [2019-11-20 04:47:13,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,049 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 04:47:13,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-20 04:47:13,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:47:13,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,062 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 04:47:13,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-20 04:47:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:47:13,078 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:47:13,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862836811] [2019-11-20 04:47:13,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:13,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-20 04:47:13,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210340953] [2019-11-20 04:47:13,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 04:47:13,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 04:47:13,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:47:13,108 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 8 states. [2019-11-20 04:47:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:13,274 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-20 04:47:13,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:47:13,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-20 04:47:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:13,275 INFO L225 Difference]: With dead ends: 69 [2019-11-20 04:47:13,276 INFO L226 Difference]: Without dead ends: 63 [2019-11-20 04:47:13,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:47:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-20 04:47:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-20 04:47:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 04:47:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-20 04:47:13,279 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 31 [2019-11-20 04:47:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:13,279 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-20 04:47:13,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 04:47:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-20 04:47:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 04:47:13,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:13,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:13,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:13,484 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-11-20 04:47:13,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:13,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1128700251] [2019-11-20 04:47:13,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:13,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 04:47:13,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:13,763 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 18 treesize of output 12 [2019-11-20 04:47:13,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 04:47:13,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:47:13,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2019-11-20 04:47:13,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2019-11-20 04:47:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:13,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 04:47:13,923 INFO L567 ElimStorePlain]: treesize reduction 9, result has 57.1 percent of original size [2019-11-20 04:47:13,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:8 [2019-11-20 04:47:13,963 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 11 treesize of output 7 [2019-11-20 04:47:13,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,973 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 04:47:13,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-20 04:47:13,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 04:47:13,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:13,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:13,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-20 04:47:14,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:14,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2019-11-20 04:47:14,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,088 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-20 04:47:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:14,089 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 04:47:14,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-20 04:47:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:47:14,232 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:14,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:14,436 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 6 treesize of output 4 [2019-11-20 04:47:14,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:14,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 04:47:14,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:47:14,630 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 04:47:14,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,635 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 15 treesize of output 13 [2019-11-20 04:47:14,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:14,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:14,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:8 [2019-11-20 04:47:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:47:14,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128700251] [2019-11-20 04:47:14,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:47:14,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-11-20 04:47:14,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021874068] [2019-11-20 04:47:14,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 04:47:14,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:47:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 04:47:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:47:14,683 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 22 states. [2019-11-20 04:47:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:47:15,707 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-20 04:47:15,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 04:47:15,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-11-20 04:47:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:47:15,709 INFO L225 Difference]: With dead ends: 62 [2019-11-20 04:47:15,709 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 04:47:15,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2019-11-20 04:47:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 04:47:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-20 04:47:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 04:47:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-20 04:47:15,712 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-11-20 04:47:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:47:15,712 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-20 04:47:15,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 04:47:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-20 04:47:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 04:47:15,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:47:15,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:47:15,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:15,918 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-20 04:47:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:47:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-11-20 04:47:15,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:47:15,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [766876951] [2019-11-20 04:47:15,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e729a6-1293-410b-921e-9e7740cf1b29/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 04:47:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:47:16,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 04:47:16,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:47:16,186 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 04:47:16,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:16,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:16,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:16,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:47:16,401 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 11 treesize of output 7 [2019-11-20 04:47:16,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:16,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:16,412 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 04:47:16,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2019-11-20 04:47:16,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-11-20 04:47:16,460 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 04:47:16,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:16,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:47:16,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-20 04:47:16,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-20 04:47:16,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:47:16,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:47:16,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:47:16,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-20 04:47:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:47:18,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:47:26,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:47:26,275 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 04:47:26,278 INFO L168 Benchmark]: Toolchain (without parser) took 61699.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:47:26,279 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:47:26,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:47:26,279 INFO L168 Benchmark]: Boogie Preprocessor took 106.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:47:26,279 INFO L168 Benchmark]: RCFGBuilder took 666.44 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:47:26,280 INFO L168 Benchmark]: TraceAbstraction took 60329.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:47:26,281 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.58 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 666.44 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60329.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...