./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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 6e748b563bb7a11726b28f7957ce1a00b7c8807b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:48:08,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:48:08,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:48:08,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:48:08,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:48:08,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:48:08,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:48:08,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:48:08,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:48:08,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:48:08,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:48:08,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:48:08,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:48:08,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:48:08,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:48:08,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:48:08,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:48:08,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:48:08,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:48:08,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:48:08,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:48:08,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:48:08,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:48:08,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:48:08,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:48:08,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:48:08,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:48:08,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:48:08,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:48:08,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:48:08,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:48:08,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:48:08,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:48:08,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:48:08,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:48:08,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:48:08,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:48:08,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:48:08,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:48:08,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:48:08,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:48:08,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 22:48:08,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:48:08,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:48:08,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:48:08,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:48:08,288 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:48:08,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:48:08,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:48:08,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:48:08,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:48:08,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:48:08,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:48:08,290 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 22:48:08,290 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 22:48:08,290 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 22:48:08,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:48:08,291 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:48:08,291 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:48:08,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:48:08,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:48:08,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:48:08,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:48:08,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:48:08,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:48:08,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:48:08,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:48:08,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:48:08,294 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:48:08,294 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:48:08,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:48:08,295 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_8fc7ca97-6add-4b97-888f-17514b4175bf/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 -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2019-11-19 22:48:08,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:48:08,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:48:08,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:48:08,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:48:08,525 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:48:08,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-11-19 22:48:08,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/data/8817d797d/82ef29086c3b444db307672b05c68ebc/FLAGd5643f71d [2019-11-19 22:48:09,081 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:48:09,082 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-11-19 22:48:09,107 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/data/8817d797d/82ef29086c3b444db307672b05c68ebc/FLAGd5643f71d [2019-11-19 22:48:09,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/data/8817d797d/82ef29086c3b444db307672b05c68ebc [2019-11-19 22:48:09,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:48:09,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 22:48:09,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:48:09,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:48:09,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:48:09,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:48:09" (1/1) ... [2019-11-19 22:48:09,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706a8c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:09, skipping insertion in model container [2019-11-19 22:48:09,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:48:09" (1/1) ... [2019-11-19 22:48:09,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:48:09,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:48:09,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:48:09,946 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:48:10,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:48:10,082 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:48:10,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10 WrapperNode [2019-11-19 22:48:10,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:48:10,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:48:10,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:48:10,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:48:10,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... [2019-11-19 22:48:10,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:48:10,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:48:10,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:48:10,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:48:10,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:10,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 22:48:10,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:48:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-19 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-19 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-19 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2019-11-19 22:48:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 22:48:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 22:48:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 22:48:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 22:48:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 22:48:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 22:48:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 22:48:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 22:48:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 22:48:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 22:48:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 22:48:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 22:48:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 22:48:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 22:48:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 22:48:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 22:48:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 22:48:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 22:48:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 22:48:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-19 22:48:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-19 22:48:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-19 22:48:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 22:48:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 22:48:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 22:48:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 22:48:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 22:48:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 22:48:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 22:48:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 22:48:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 22:48:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 22:48:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 22:48:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 22:48:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 22:48:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 22:48:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 22:48:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 22:48:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 22:48:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 22:48:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 22:48:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 22:48:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 22:48:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 22:48:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 22:48:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 22:48:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 22:48:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 22:48:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 22:48:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 22:48:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 22:48:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 22:48:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 22:48:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 22:48:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 22:48:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 22:48:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 22:48:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 22:48:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 22:48:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 22:48:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 22:48:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 22:48:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 22:48:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 22:48:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 22:48:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 22:48:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 22:48:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 22:48:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 22:48:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 22:48:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 22:48:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 22:48:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 22:48:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 22:48:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 22:48:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 22:48:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 22:48:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 22:48:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 22:48:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 22:48:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 22:48:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 22:48:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 22:48:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 22:48:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 22:48:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 22:48:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 22:48:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 22:48:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 22:48:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 22:48:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 22:48:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 22:48:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 22:48:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 22:48:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 22:48:10,241 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 22:48:10,241 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 22:48:10,241 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 22:48:10,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-19 22:48:10,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-19 22:48:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2019-11-19 22:48:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-19 22:48:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 22:48:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:48:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-19 22:48:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:48:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 22:48:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:48:10,953 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:48:10,953 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:48:10,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:48:10 BoogieIcfgContainer [2019-11-19 22:48:10,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:48:10,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:48:10,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:48:10,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:48:10,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:48:09" (1/3) ... [2019-11-19 22:48:10,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5181e380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:48:10, skipping insertion in model container [2019-11-19 22:48:10,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:48:10" (2/3) ... [2019-11-19 22:48:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5181e380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:48:10, skipping insertion in model container [2019-11-19 22:48:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:48:10" (3/3) ... [2019-11-19 22:48:10,964 INFO L109 eAbstractionObserver]: Analyzing ICFG substring-alloca-2.i [2019-11-19 22:48:10,975 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:48:10,983 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-19 22:48:10,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-19 22:48:11,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:48:11,019 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 22:48:11,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:48:11,019 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:48:11,019 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:48:11,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:48:11,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:48:11,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:48:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-19 22:48:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:48:11,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:11,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:11,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash -391744755, now seen corresponding path program 1 times [2019-11-19 22:48:11,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:11,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [219712931] [2019-11-19 22:48:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:11,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:48:11,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:11,384 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-19 22:48:11,384 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:11,444 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-19 22:48:11,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [219712931] [2019-11-19 22:48:11,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:11,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:48:11,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476020698] [2019-11-19 22:48:11,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:48:11,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:48:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:11,473 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 6 states. [2019-11-19 22:48:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:11,672 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-19 22:48:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:48:11,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-19 22:48:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:11,687 INFO L225 Difference]: With dead ends: 81 [2019-11-19 22:48:11,687 INFO L226 Difference]: Without dead ends: 77 [2019-11-19 22:48:11,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-19 22:48:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-11-19 22:48:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 22:48:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-11-19 22:48:11,743 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 11 [2019-11-19 22:48:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:11,743 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-11-19 22:48:11,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:48:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-11-19 22:48:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:48:11,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:11,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:11,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:11,952 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash -389897713, now seen corresponding path program 1 times [2019-11-19 22:48:11,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:11,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1808279616] [2019-11-19 22:48:11,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:12,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:48:12,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:12,249 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_37|]} [2019-11-19 22:48:12,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:12,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:12,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:12,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:48:12,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:12,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-19 22:48:12,406 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-19 22:48:12,406 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:12,549 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:48:12,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:48:12,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:12,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:48:12,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:12,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:12,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-19 22:48:12,613 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-19 22:48:12,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808279616] [2019-11-19 22:48:12,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:12,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 22:48:12,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100479638] [2019-11-19 22:48:12,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:48:12,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:48:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:48:12,617 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2019-11-19 22:48:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:13,337 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-19 22:48:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:48:13,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 22:48:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:13,341 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:48:13,341 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 22:48:13,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:48:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 22:48:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2019-11-19 22:48:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 22:48:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-19 22:48:13,352 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 11 [2019-11-19 22:48:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:13,353 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-19 22:48:13,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:48:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-19 22:48:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:48:13,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:13,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:13,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:13,562 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash -389897714, now seen corresponding path program 1 times [2019-11-19 22:48:13,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:13,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1997996218] [2019-11-19 22:48:13,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:13,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:48:13,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:13,838 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-19 22:48:13,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:13,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:13,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:13,852 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-19 22:48:13,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-19 22:48:13,873 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-19 22:48:13,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:13,884 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-19 22:48:13,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1997996218] [2019-11-19 22:48:13,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:13,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:48:13,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404269200] [2019-11-19 22:48:13,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:48:13,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:48:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:48:13,886 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2019-11-19 22:48:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:14,033 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-19 22:48:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:48:14,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 22:48:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:14,036 INFO L225 Difference]: With dead ends: 60 [2019-11-19 22:48:14,036 INFO L226 Difference]: Without dead ends: 60 [2019-11-19 22:48:14,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-19 22:48:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-19 22:48:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-19 22:48:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 22:48:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-11-19 22:48:14,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 11 [2019-11-19 22:48:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:14,046 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-19 22:48:14,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:48:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-11-19 22:48:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:48:14,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:14,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:14,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:14,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1490361092, now seen corresponding path program 1 times [2019-11-19 22:48:14,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:14,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1895282825] [2019-11-19 22:48:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:14,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:48:14,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:14,559 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_47|]} [2019-11-19 22:48:14,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:14,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:14,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:14,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:14,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:48:14,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:14,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:14,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:14,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:14 [2019-11-19 22:48:14,662 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-19 22:48:14,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:48:14,791 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:48:14,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:14,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:14,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:14,820 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-19 22:48:14,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:48:14,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:11 [2019-11-19 22:48:14,877 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-19 22:48:14,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1895282825] [2019-11-19 22:48:14,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:14,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-19 22:48:14,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774172261] [2019-11-19 22:48:14,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:48:14,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:48:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:14,879 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2019-11-19 22:48:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:15,532 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-11-19 22:48:15,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:48:15,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-19 22:48:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:15,535 INFO L225 Difference]: With dead ends: 74 [2019-11-19 22:48:15,535 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:48:15,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:48:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:48:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2019-11-19 22:48:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 22:48:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-19 22:48:15,545 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2019-11-19 22:48:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:15,546 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-19 22:48:15,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:48:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-19 22:48:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:48:15,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:15,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:15,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:15,748 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1490361144, now seen corresponding path program 1 times [2019-11-19 22:48:15,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:15,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [671737072] [2019-11-19 22:48:15,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:15,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:48:15,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:15,978 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-19 22:48:15,979 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:16,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671737072] [2019-11-19 22:48:16,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:16,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:48:16,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909528067] [2019-11-19 22:48:16,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:48:16,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:48:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:16,027 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 6 states. [2019-11-19 22:48:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:16,160 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-19 22:48:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:48:16,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-19 22:48:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:16,163 INFO L225 Difference]: With dead ends: 79 [2019-11-19 22:48:16,163 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 22:48:16,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 22:48:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-11-19 22:48:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 22:48:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-19 22:48:16,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 13 [2019-11-19 22:48:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:16,172 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-19 22:48:16,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:48:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-11-19 22:48:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:48:16,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:16,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:16,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:16,378 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1547619446, now seen corresponding path program 1 times [2019-11-19 22:48:16,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:16,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1203324005] [2019-11-19 22:48:16,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:16,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:48:16,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:16,629 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-19 22:48:16,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:16,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:16,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:16,639 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-19 22:48:16,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-19 22:48:16,655 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-19 22:48:16,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:16,665 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-19 22:48:16,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1203324005] [2019-11-19 22:48:16,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:16,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:48:16,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820035630] [2019-11-19 22:48:16,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:48:16,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:48:16,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:48:16,667 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 3 states. [2019-11-19 22:48:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:16,779 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-11-19 22:48:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:48:16,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 22:48:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:16,781 INFO L225 Difference]: With dead ends: 68 [2019-11-19 22:48:16,782 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 22:48:16,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:48:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 22:48:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 22:48:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 22:48:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-19 22:48:16,789 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 13 [2019-11-19 22:48:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:16,790 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-19 22:48:16,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:48:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-19 22:48:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:48:16,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:16,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:17,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:17,005 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1547619447, now seen corresponding path program 1 times [2019-11-19 22:48:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:17,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [837135369] [2019-11-19 22:48:17,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:17,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:48:17,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:17,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:17,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:48:17,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:17,347 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-19 22:48:17,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:17,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-19 22:48:17,409 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-19 22:48:17,410 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:17,559 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-19 22:48:17,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [837135369] [2019-11-19 22:48:17,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:17,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:48:17,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317553905] [2019-11-19 22:48:17,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:48:17,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:48:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:48:17,561 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2019-11-19 22:48:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:18,113 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2019-11-19 22:48:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:48:18,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-19 22:48:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:18,115 INFO L225 Difference]: With dead ends: 79 [2019-11-19 22:48:18,115 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 22:48:18,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:48:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 22:48:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-11-19 22:48:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 22:48:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-11-19 22:48:18,122 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 13 [2019-11-19 22:48:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:18,122 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-11-19 22:48:18,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:48:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-11-19 22:48:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:48:18,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:18,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:18,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:18,324 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1043446404, now seen corresponding path program 1 times [2019-11-19 22:48:18,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:18,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1320196431] [2019-11-19 22:48:18,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:18,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:48:18,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:18,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:18,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:48:18,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:18,566 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-19 22:48:18,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:18,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-11-19 22:48:18,579 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-19 22:48:18,580 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:18,688 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-19 22:48:18,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320196431] [2019-11-19 22:48:18,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:18,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-19 22:48:18,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610036346] [2019-11-19 22:48:18,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:48:18,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:48:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:18,690 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 6 states. [2019-11-19 22:48:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:19,071 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-11-19 22:48:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:48:19,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 22:48:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:19,073 INFO L225 Difference]: With dead ends: 76 [2019-11-19 22:48:19,073 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 22:48:19,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:48:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 22:48:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-11-19 22:48:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 22:48:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-19 22:48:19,079 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 14 [2019-11-19 22:48:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:19,080 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-19 22:48:19,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:48:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-11-19 22:48:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:48:19,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:19,081 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:19,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:19,285 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1553442094, now seen corresponding path program 1 times [2019-11-19 22:48:19,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:19,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [673266236] [2019-11-19 22:48:19,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:19,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:48:19,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:19,502 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_69|]} [2019-11-19 22:48:19,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:19,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:19,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:19,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:19,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 10 treesize of output 8 [2019-11-19 22:48:19,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:19,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:19,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:19,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-19 22:48:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:19,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:20,249 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:48:20,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:20,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:20,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:20,263 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-19 22:48:20,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:20,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-11-19 22:48:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:20,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [673266236] [2019-11-19 22:48:20,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:48:20,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-19 22:48:20,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150750748] [2019-11-19 22:48:20,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:48:20,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:48:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:48:20,269 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 10 states. [2019-11-19 22:48:20,605 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-19 22:48:21,521 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-19 22:48:21,970 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-19 22:48:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:22,325 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2019-11-19 22:48:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:48:22,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-19 22:48:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:22,328 INFO L225 Difference]: With dead ends: 133 [2019-11-19 22:48:22,328 INFO L226 Difference]: Without dead ends: 133 [2019-11-19 22:48:22,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:48:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-19 22:48:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 85. [2019-11-19 22:48:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:48:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-11-19 22:48:22,336 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 15 [2019-11-19 22:48:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:22,336 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-11-19 22:48:22,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:48:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-11-19 22:48:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:48:22,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:22,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:22,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:22,541 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1661532524, now seen corresponding path program 1 times [2019-11-19 22:48:22,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:22,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1479007926] [2019-11-19 22:48:22,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:22,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:48:22,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:22,791 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-19 22:48:22,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:22,800 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-19 22:48:22,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:22,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:22,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:22,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-19 22:48:22,815 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-19 22:48:22,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1479007926] [2019-11-19 22:48:22,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:22,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 22:48:22,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41746995] [2019-11-19 22:48:22,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:48:22,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:48:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:48:22,817 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 5 states. [2019-11-19 22:48:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:23,041 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2019-11-19 22:48:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:48:23,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-19 22:48:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:23,044 INFO L225 Difference]: With dead ends: 84 [2019-11-19 22:48:23,044 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 22:48:23,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-19 22:48:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 22:48:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-19 22:48:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-19 22:48:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-11-19 22:48:23,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 17 [2019-11-19 22:48:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:23,051 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-11-19 22:48:23,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:48:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-11-19 22:48:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:48:23,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:23,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:23,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:23,254 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1661532525, now seen corresponding path program 1 times [2019-11-19 22:48:23,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:23,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1862381159] [2019-11-19 22:48:23,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:23,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:48:23,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:23,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:48:23,831 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-19 22:48:23,832 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-19 22:48:23,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-19 22:48:23,864 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-19 22:48:23,882 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-19 22:48:23,883 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-19 22:48:23,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:23,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-19 22:48:23,939 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-19 22:48:24,175 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-19 22:48:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862381159] [2019-11-19 22:48:24,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:24,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-19 22:48:24,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761389410] [2019-11-19 22:48:24,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:48:24,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:48:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:48:24,178 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 12 states. [2019-11-19 22:48:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:25,085 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2019-11-19 22:48:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:48:25,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-19 22:48:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:25,089 INFO L225 Difference]: With dead ends: 122 [2019-11-19 22:48:25,089 INFO L226 Difference]: Without dead ends: 122 [2019-11-19 22:48:25,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:48:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-19 22:48:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2019-11-19 22:48:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:48:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-11-19 22:48:25,096 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 17 [2019-11-19 22:48:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:25,096 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-11-19 22:48:25,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:48:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-11-19 22:48:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:48:25,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:25,098 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:25,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:25,299 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1317111226, now seen corresponding path program 1 times [2019-11-19 22:48:25,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:25,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1911892698] [2019-11-19 22:48:25,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:25,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:48:25,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:25,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:25,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:48:25,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:25,571 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-19 22:48:25,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:25,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-19 22:48:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:25,719 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:26,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911892698] [2019-11-19 22:48:26,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:48:26,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-19 22:48:26,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104433817] [2019-11-19 22:48:26,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:48:26,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:48:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:48:26,443 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 12 states. [2019-11-19 22:48:27,578 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-19 22:48:27,829 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-11-19 22:48:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:28,501 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2019-11-19 22:48:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:48:28,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-19 22:48:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:28,503 INFO L225 Difference]: With dead ends: 102 [2019-11-19 22:48:28,503 INFO L226 Difference]: Without dead ends: 102 [2019-11-19 22:48:28,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:48:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-19 22:48:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2019-11-19 22:48:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-19 22:48:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2019-11-19 22:48:28,508 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 17 [2019-11-19 22:48:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:28,508 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2019-11-19 22:48:28,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:48:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2019-11-19 22:48:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:48:28,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:28,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:28,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:28,712 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -995076911, now seen corresponding path program 1 times [2019-11-19 22:48:28,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:28,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1959652395] [2019-11-19 22:48:28,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:28,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:48:28,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:28,931 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-19 22:48:28,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:28,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:28,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:28,939 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-19 22:48:28,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-19 22:48:29,008 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-19 22:48:29,009 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:29,081 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-19 22:48:29,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1959652395] [2019-11-19 22:48:29,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:29,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 6 [2019-11-19 22:48:29,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813676641] [2019-11-19 22:48:29,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:48:29,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:29,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:48:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:48:29,083 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 7 states. [2019-11-19 22:48:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:29,285 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-11-19 22:48:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:48:29,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-19 22:48:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:29,287 INFO L225 Difference]: With dead ends: 83 [2019-11-19 22:48:29,287 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 22:48:29,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:48:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 22:48:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-11-19 22:48:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 22:48:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-19 22:48:29,291 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 19 [2019-11-19 22:48:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:29,292 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-19 22:48:29,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:48:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-11-19 22:48:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:48:29,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:29,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:29,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:29,496 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash -995076910, now seen corresponding path program 1 times [2019-11-19 22:48:29,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:29,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [180360986] [2019-11-19 22:48:29,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:29,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:48:29,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:29,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:29,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:48:29,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:29,756 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-19 22:48:29,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:29,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-19 22:48:29,812 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-19 22:48:29,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:30,107 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-19 22:48:30,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180360986] [2019-11-19 22:48:30,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:30,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-19 22:48:30,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424602219] [2019-11-19 22:48:30,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:48:30,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:48:30,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:48:30,109 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 12 states. [2019-11-19 22:48:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:31,575 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-11-19 22:48:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:48:31,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-19 22:48:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:31,578 INFO L225 Difference]: With dead ends: 130 [2019-11-19 22:48:31,578 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:48:31,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:48:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:48:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2019-11-19 22:48:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 22:48:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-19 22:48:31,583 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 19 [2019-11-19 22:48:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:31,583 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-19 22:48:31,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:48:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-19 22:48:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:31,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:31,585 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-19 22:48:31,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:31,789 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1744606647, now seen corresponding path program 1 times [2019-11-19 22:48:31,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:31,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2119300075] [2019-11-19 22:48:31,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:31,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:48:31,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:31,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:31,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2119300075] [2019-11-19 22:48:31,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:31,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 22:48:31,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950442545] [2019-11-19 22:48:31,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:48:31,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:48:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:48:31,969 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 3 states. [2019-11-19 22:48:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:31,979 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2019-11-19 22:48:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:48:31,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:48:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:31,980 INFO L225 Difference]: With dead ends: 79 [2019-11-19 22:48:31,981 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 22:48:31,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:48:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 22:48:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-19 22:48:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 22:48:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-19 22:48:31,985 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 23 [2019-11-19 22:48:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:31,985 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-19 22:48:31,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:48:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-11-19 22:48:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:31,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:31,986 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-19 22:48:32,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:32,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1744615721, now seen corresponding path program 1 times [2019-11-19 22:48:32,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:32,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [580895152] [2019-11-19 22:48:32,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:32,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:48:32,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:32,427 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-19 22:48:32,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:32,446 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-19 22:48:32,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:32,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:32,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:32,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-19 22:48:32,455 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-19 22:48:32,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580895152] [2019-11-19 22:48:32,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:32,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-19 22:48:32,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416960721] [2019-11-19 22:48:32,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:48:32,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:48:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:48:32,457 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 6 states. [2019-11-19 22:48:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:32,660 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2019-11-19 22:48:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:48:32,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-19 22:48:32,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:32,662 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:48:32,662 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 22:48:32,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:48:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 22:48:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-19 22:48:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 22:48:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-19 22:48:32,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 23 [2019-11-19 22:48:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:32,667 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-19 22:48:32,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:48:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-19 22:48:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:32,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:32,668 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-19 22:48:32,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:32,871 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1744615720, now seen corresponding path program 1 times [2019-11-19 22:48:32,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:32,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1809556313] [2019-11-19 22:48:32,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:33,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 22:48:33,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:33,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-19 22:48:33,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:33,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:33,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:33,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-19 22:48:33,291 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-19 22:48:33,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:33,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:33,452 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 14 [2019-11-19 22:48:33,458 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 29 treesize of output 27 [2019-11-19 22:48:33,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 22:48:33,464 INFO L567 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-11-19 22:48:33,464 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:33,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:33,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:33,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:6 [2019-11-19 22:48:33,478 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-19 22:48:33,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809556313] [2019-11-19 22:48:33,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:33,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2019-11-19 22:48:33,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605084038] [2019-11-19 22:48:33,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:48:33,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:48:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:48:33,480 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 16 states. [2019-11-19 22:48:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:34,054 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2019-11-19 22:48:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:48:34,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-19 22:48:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:34,056 INFO L225 Difference]: With dead ends: 103 [2019-11-19 22:48:34,056 INFO L226 Difference]: Without dead ends: 103 [2019-11-19 22:48:34,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:48:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-19 22:48:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-11-19 22:48:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-19 22:48:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-19 22:48:34,061 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 23 [2019-11-19 22:48:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:34,062 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-19 22:48:34,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:48:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-19 22:48:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:34,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:34,063 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-19 22:48:34,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:34,264 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1768533058, now seen corresponding path program 1 times [2019-11-19 22:48:34,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:34,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [717954625] [2019-11-19 22:48:34,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:34,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:48:34,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:34,522 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-19 22:48:34,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:34,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:34,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:34,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:48:34,647 INFO L343 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2019-11-19 22:48:34,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 49 [2019-11-19 22:48:34,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:34,678 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-19 22:48:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:48:34,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-11-19 22:48:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:34,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:36,895 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-19 22:48:36,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:41,289 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-19 22:48:41,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717954625] [2019-11-19 22:48:41,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:41,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-19 22:48:41,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438475036] [2019-11-19 22:48:41,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:48:41,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:48:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=60, Unknown=3, NotChecked=0, Total=90 [2019-11-19 22:48:41,291 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 10 states. [2019-11-19 22:48:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:55,880 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2019-11-19 22:48:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:48:55,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-19 22:48:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:55,883 INFO L225 Difference]: With dead ends: 93 [2019-11-19 22:48:55,883 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 22:48:55,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=40, Invalid=89, Unknown=3, NotChecked=0, Total=132 [2019-11-19 22:48:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 22:48:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 22:48:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:48:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2019-11-19 22:48:55,887 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 23 [2019-11-19 22:48:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:55,887 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2019-11-19 22:48:55,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:48:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2019-11-19 22:48:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:55,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:55,888 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-19 22:48:56,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:56,089 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1529283222, now seen corresponding path program 1 times [2019-11-19 22:48:56,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:56,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [239850876] [2019-11-19 22:48:56,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:48:56,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:48:56,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:56,402 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-19 22:48:56,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:56,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:48:56,516 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-19 22:48:56,517 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-19 22:48:56,526 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-19 22:48:56,526 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-19 22:48:56,590 INFO L567 ElimStorePlain]: treesize reduction 7, result has 69.6 percent of original size [2019-11-19 22:48:56,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-19 22:48:56,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-19 22:48:56,824 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-19 22:48:56,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [239850876] [2019-11-19 22:48:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-19 22:48:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282308261] [2019-11-19 22:48:56,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:48:56,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:48:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:48:56,826 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 12 states. [2019-11-19 22:48:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:48:57,941 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2019-11-19 22:48:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:48:57,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-19 22:48:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:48:57,944 INFO L225 Difference]: With dead ends: 136 [2019-11-19 22:48:57,944 INFO L226 Difference]: Without dead ends: 136 [2019-11-19 22:48:57,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-11-19 22:48:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-19 22:48:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 89. [2019-11-19 22:48:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:48:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2019-11-19 22:48:57,949 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 23 [2019-11-19 22:48:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:48:57,949 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2019-11-19 22:48:57,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:48:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2019-11-19 22:48:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:48:57,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:48:57,950 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:48:58,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:48:58,151 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:48:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:48:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 347881432, now seen corresponding path program 2 times [2019-11-19 22:48:58,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:48:58,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [966250027] [2019-11-19 22:48:58,152 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:48:58,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:48:58,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:48:58,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:48:58,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:48:58,396 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 1=[|v_#valid_118|]} [2019-11-19 22:48:58,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:48:58,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:48:58,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:58,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:58,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:48:58,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:58,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:58,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:58,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-19 22:48:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:58,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:48:59,762 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:48:59,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 10 treesize of output 8 [2019-11-19 22:48:59,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:59,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:59,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:48:59,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:48:59,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:48:59,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:48:59,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:10 [2019-11-19 22:48:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:59,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [966250027] [2019-11-19 22:48:59,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:48:59,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-19 22:48:59,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498781261] [2019-11-19 22:48:59,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:48:59,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:48:59,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:48:59,910 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 15 states. [2019-11-19 22:49:02,269 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-19 22:49:05,210 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-19 22:49:06,015 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-19 22:49:06,455 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 22:49:07,041 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-19 22:49:07,336 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 22:49:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:07,756 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2019-11-19 22:49:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:49:07,757 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-19 22:49:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:07,759 INFO L225 Difference]: With dead ends: 220 [2019-11-19 22:49:07,759 INFO L226 Difference]: Without dead ends: 220 [2019-11-19 22:49:07,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:49:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-19 22:49:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 129. [2019-11-19 22:49:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-19 22:49:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2019-11-19 22:49:07,766 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 23 [2019-11-19 22:49:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:07,766 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2019-11-19 22:49:07,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:49:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2019-11-19 22:49:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:49:07,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:07,767 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] [2019-11-19 22:49:07,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:07,971 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1529776103, now seen corresponding path program 1 times [2019-11-19 22:49:07,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:07,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [320092283] [2019-11-19 22:49:07,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/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-19 22:49:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:08,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:49:08,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:08,169 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-19 22:49:08,170 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-19 22:49:08,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:08,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:08,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2019-11-19 22:49:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:08,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:08,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [320092283] [2019-11-19 22:49:08,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:49:08,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-19 22:49:08,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12896533] [2019-11-19 22:49:08,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:49:08,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:08,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:49:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:49:08,311 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 9 states. [2019-11-19 22:49:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:08,554 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-11-19 22:49:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:49:08,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-19 22:49:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:08,555 INFO L225 Difference]: With dead ends: 130 [2019-11-19 22:49:08,556 INFO L226 Difference]: Without dead ends: 111 [2019-11-19 22:49:08,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:49:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-19 22:49:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-19 22:49:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 22:49:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-11-19 22:49:08,560 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 25 [2019-11-19 22:49:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:08,560 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-11-19 22:49:08,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:49:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-11-19 22:49:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:49:08,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:08,561 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] [2019-11-19 22:49:08,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:08,764 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2136570404, now seen corresponding path program 1 times [2019-11-19 22:49:08,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:08,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1881769226] [2019-11-19 22:49:08,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:08,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 22:49:08,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:09,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:09,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:49:09,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:09,072 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-19 22:49:09,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:09,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-19 22:49:09,098 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 17 treesize of output 13 [2019-11-19 22:49:09,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:09,143 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-19 22:49:09,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:09,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-11-19 22:49:09,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:09,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-19 22:49:09,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:09,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:09,630 INFO L567 ElimStorePlain]: treesize reduction 8, result has 69.2 percent of original size [2019-11-19 22:49:09,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:09,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-11-19 22:49:09,774 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-19 22:49:09,774 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:10,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:10,878 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 38 treesize of output 36 [2019-11-19 22:49:10,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:49:10,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:49:10,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-19 22:49:10,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:10,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:10,935 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:10,949 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 40 treesize of output 38 [2019-11-19 22:49:10,979 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 29 treesize of output 27 [2019-11-19 22:49:10,981 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:11,066 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-19 22:49:11,067 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:11,080 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 40 treesize of output 38 [2019-11-19 22:49:11,114 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 29 treesize of output 27 [2019-11-19 22:49:11,116 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:11,215 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-19 22:49:11,215 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:11,344 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-19 22:49:11,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:11,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 22:49:11,345 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:83 [2019-11-19 22:49:11,741 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-19 22:49:11,767 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-19 22:49:11,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1881769226] [2019-11-19 22:49:11,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:49:11,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2019-11-19 22:49:11,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672589165] [2019-11-19 22:49:11,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:49:11,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:49:11,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:49:11,769 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 22 states. [2019-11-19 22:49:12,238 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-19 22:49:13,818 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 22:49:14,393 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-19 22:49:15,077 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-19 22:49:15,371 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-19 22:49:15,690 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 22:49:16,062 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-11-19 22:49:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:16,860 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2019-11-19 22:49:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:49:16,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-19 22:49:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:16,864 INFO L225 Difference]: With dead ends: 133 [2019-11-19 22:49:16,864 INFO L226 Difference]: Without dead ends: 133 [2019-11-19 22:49:16,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=257, Invalid=1003, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 22:49:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-19 22:49:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2019-11-19 22:49:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-19 22:49:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2019-11-19 22:49:16,869 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 26 [2019-11-19 22:49:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:16,869 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2019-11-19 22:49:16,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:49:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2019-11-19 22:49:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:49:16,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:16,870 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-19 22:49:17,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:17,074 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -249824532, now seen corresponding path program 1 times [2019-11-19 22:49:17,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:17,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [89391887] [2019-11-19 22:49:17,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:17,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:49:17,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:17,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:49:17,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:17,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:17,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:17,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-19 22:49:17,866 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-11-19 22:49:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:17,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:18,155 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 14 [2019-11-19 22:49:18,159 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 29 treesize of output 27 [2019-11-19 22:49:18,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:18,165 INFO L567 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-11-19 22:49:18,166 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:18,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:18,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:18,168 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:6 [2019-11-19 22:49:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:18,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [89391887] [2019-11-19 22:49:18,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:49:18,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2019-11-19 22:49:18,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059141598] [2019-11-19 22:49:18,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:49:18,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:18,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:49:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:49:18,345 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 21 states. [2019-11-19 22:49:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:19,515 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-11-19 22:49:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:49:19,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-19 22:49:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:19,517 INFO L225 Difference]: With dead ends: 135 [2019-11-19 22:49:19,517 INFO L226 Difference]: Without dead ends: 126 [2019-11-19 22:49:19,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:49:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-19 22:49:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-11-19 22:49:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-19 22:49:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2019-11-19 22:49:19,523 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 28 [2019-11-19 22:49:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:19,523 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2019-11-19 22:49:19,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:49:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2019-11-19 22:49:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:49:19,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:19,524 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, 1] [2019-11-19 22:49:19,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:19,725 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1696412489, now seen corresponding path program 1 times [2019-11-19 22:49:19,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:19,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1887176169] [2019-11-19 22:49:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:20,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:49:20,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:20,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:49:20,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:20,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-19 22:49:20,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-19 22:49:20,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:20,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-19 22:49:20,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-19 22:49:20,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:20,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:20,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-11-19 22:49:20,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2019-11-19 22:49:20,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:20,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:9 [2019-11-19 22:49:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:49:20,431 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:20,637 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 14 [2019-11-19 22:49:20,640 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 29 treesize of output 27 [2019-11-19 22:49:20,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:20,647 INFO L567 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-11-19 22:49:20,647 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:20,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:20,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:6 [2019-11-19 22:49:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:49:20,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1887176169] [2019-11-19 22:49:20,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:49:20,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 13 [2019-11-19 22:49:20,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622981944] [2019-11-19 22:49:20,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:49:20,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:49:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:49:20,670 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 13 states. [2019-11-19 22:49:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:21,285 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2019-11-19 22:49:21,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:49:21,287 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-11-19 22:49:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:21,287 INFO L225 Difference]: With dead ends: 134 [2019-11-19 22:49:21,288 INFO L226 Difference]: Without dead ends: 119 [2019-11-19 22:49:21,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:49:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-19 22:49:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-19 22:49:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-19 22:49:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-11-19 22:49:21,293 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 32 [2019-11-19 22:49:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:21,293 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-11-19 22:49:21,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:49:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-11-19 22:49:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:49:21,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:21,294 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, 1] [2019-11-19 22:49:21,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:21,495 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1758452103, now seen corresponding path program 1 times [2019-11-19 22:49:21,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:21,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [545871543] [2019-11-19 22:49:21,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:21,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-19 22:49:21,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:21,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:49:21,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:21,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:21,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:21,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-19 22:49:21,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:49:21,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:21,962 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-19 22:49:21,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:21,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2019-11-19 22:49:22,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-19 22:49:22,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:22,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:22,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:22,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2019-11-19 22:49:22,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:22,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-19 22:49:22,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:22,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:22,257 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-19 22:49:22,322 INFO L567 ElimStorePlain]: treesize reduction 7, result has 83.3 percent of original size [2019-11-19 22:49:22,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:22,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:22,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:31 [2019-11-19 22:49:22,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:22,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:49:23,135 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:24,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:49:24,224 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 56 treesize of output 50 [2019-11-19 22:49:24,225 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-19 22:49:24,260 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 56 treesize of output 52 [2019-11-19 22:49:24,260 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-19 22:49:24,285 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 54 treesize of output 50 [2019-11-19 22:49:24,286 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-19 22:49:24,712 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-19 22:49:24,712 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.2 percent of original size [2019-11-19 22:49:24,754 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 46 treesize of output 44 [2019-11-19 22:49:24,808 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 29 treesize of output 27 [2019-11-19 22:49:24,810 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:24,934 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-11-19 22:49:24,934 INFO L567 ElimStorePlain]: treesize reduction 7, result has 83.7 percent of original size [2019-11-19 22:49:24,934 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:24,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-11-19 22:49:25,019 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 29 treesize of output 27 [2019-11-19 22:49:25,021 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:25,246 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-19 22:49:25,246 INFO L567 ElimStorePlain]: treesize reduction 7, result has 85.1 percent of original size [2019-11-19 22:49:25,247 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:25,281 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 44 treesize of output 42 [2019-11-19 22:49:25,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:49:25,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:49:25,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-19 22:49:25,328 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:25,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:25,396 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:25,639 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 22:49:25,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:25,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-19 22:49:25,641 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:167, output treesize:105 [2019-11-19 22:49:26,282 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-19 22:49:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:49:26,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [545871543] [2019-11-19 22:49:26,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:49:26,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-19 22:49:26,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831390494] [2019-11-19 22:49:26,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:49:26,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:49:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:49:26,326 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 18 states. [2019-11-19 22:49:29,477 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-19 22:49:29,858 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:49:32,903 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-19 22:49:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:34,049 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2019-11-19 22:49:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:49:34,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-11-19 22:49:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:34,055 INFO L225 Difference]: With dead ends: 174 [2019-11-19 22:49:34,055 INFO L226 Difference]: Without dead ends: 174 [2019-11-19 22:49:34,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:49:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-19 22:49:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2019-11-19 22:49:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-19 22:49:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-11-19 22:49:34,061 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 32 [2019-11-19 22:49:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:34,062 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-11-19 22:49:34,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:49:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-11-19 22:49:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:49:34,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:34,064 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:49:34,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:34,264 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1983678141, now seen corresponding path program 1 times [2019-11-19 22:49:34,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:34,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1916962175] [2019-11-19 22:49:34,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:34,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 22:49:34,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:34,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:49:34,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:34,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:34,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:34,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-19 22:49:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:35,100 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:35,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:49:35,457 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 16 [2019-11-19 22:49:35,463 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 35 treesize of output 31 [2019-11-19 22:49:35,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 22:49:35,469 INFO L567 ElimStorePlain]: treesize reduction 7, result has 53.3 percent of original size [2019-11-19 22:49:35,469 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:35,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:35,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:35,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:8 [2019-11-19 22:49:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:35,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1916962175] [2019-11-19 22:49:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:49:35,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-19 22:49:35,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141573584] [2019-11-19 22:49:35,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 22:49:35,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 22:49:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-11-19 22:49:35,828 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 26 states. [2019-11-19 22:49:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:37,573 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2019-11-19 22:49:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:49:37,574 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-11-19 22:49:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:37,575 INFO L225 Difference]: With dead ends: 186 [2019-11-19 22:49:37,575 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 22:49:37,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 22:49:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 22:49:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2019-11-19 22:49:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-19 22:49:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-11-19 22:49:37,582 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 34 [2019-11-19 22:49:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:37,582 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-11-19 22:49:37,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 22:49:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-11-19 22:49:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 22:49:37,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:37,584 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:49:37,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:37,787 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -388647334, now seen corresponding path program 2 times [2019-11-19 22:49:37,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:37,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1201611469] [2019-11-19 22:49:37,789 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:38,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-19 22:49:38,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:49:38,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:49:38,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:38,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:49:38,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:38,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-19 22:49:38,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:49:38,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:38,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:38,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-19 22:49:38,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-19 22:49:38,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:38,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:38,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2019-11-19 22:49:38,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:49:38,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-19 22:49:38,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:38,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:38,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:5 [2019-11-19 22:49:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:49:38,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:39,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-11-19 22:49:39,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-19 22:49:39,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:39,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:39,033 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:39,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:39,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:39,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-19 22:49:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:49:39,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1201611469] [2019-11-19 22:49:39,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:49:39,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2019-11-19 22:49:39,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251542] [2019-11-19 22:49:39,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:49:39,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:49:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:49:39,218 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2019-11-19 22:49:40,006 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-19 22:49:40,260 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-19 22:49:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:40,420 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2019-11-19 22:49:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:49:40,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-19 22:49:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:40,422 INFO L225 Difference]: With dead ends: 198 [2019-11-19 22:49:40,422 INFO L226 Difference]: Without dead ends: 176 [2019-11-19 22:49:40,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:49:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-19 22:49:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-11-19 22:49:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-19 22:49:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2019-11-19 22:49:40,427 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 38 [2019-11-19 22:49:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:40,428 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2019-11-19 22:49:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:49:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2019-11-19 22:49:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:49:40,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:40,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:49:40,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:40,632 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -9073993, now seen corresponding path program 1 times [2019-11-19 22:49:40,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:40,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [190009941] [2019-11-19 22:49:40,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:40,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 22:49:40,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:49:41,526 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:49:42,973 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 38 treesize of output 32 [2019-11-19 22:49:42,973 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-19 22:49:43,006 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 40 treesize of output 34 [2019-11-19 22:49:43,007 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-19 22:49:43,050 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 40 treesize of output 32 [2019-11-19 22:49:43,050 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-19 22:49:43,424 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-19 22:49:43,424 INFO L567 ElimStorePlain]: treesize reduction 13, result has 86.9 percent of original size [2019-11-19 22:49:43,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-19 22:49:43,425 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:119, output treesize:86 [2019-11-19 22:49:45,828 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-11-19 22:49:46,381 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-19 22:49:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:49:46,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [190009941] [2019-11-19 22:49:46,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:49:46,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-19 22:49:46,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863379472] [2019-11-19 22:49:46,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 22:49:46,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 22:49:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:49:46,414 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 24 states. [2019-11-19 22:49:47,402 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-19 22:49:48,194 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-19 22:49:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:50,985 INFO L93 Difference]: Finished difference Result 219 states and 243 transitions. [2019-11-19 22:49:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 22:49:50,994 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-11-19 22:49:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:50,995 INFO L225 Difference]: With dead ends: 219 [2019-11-19 22:49:50,995 INFO L226 Difference]: Without dead ends: 219 [2019-11-19 22:49:50,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 22:49:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-19 22:49:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 176. [2019-11-19 22:49:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-19 22:49:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2019-11-19 22:49:51,000 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 42 [2019-11-19 22:49:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:51,001 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2019-11-19 22:49:51,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 22:49:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2019-11-19 22:49:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:49:51,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:51,002 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:49:51,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:51,203 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:49:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1545051687, now seen corresponding path program 3 times [2019-11-19 22:49:51,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:51,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [331393425] [2019-11-19 22:49:51,204 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:51,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 22:49:51,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:49:51,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:49:51,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:51,443 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_156|]} [2019-11-19 22:49:51,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:49:51,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:49:51,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:51,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:51,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:49:51,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:51,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:51,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:51,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2019-11-19 22:49:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-19 22:49:51,752 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:52,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:49:56,700 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-19 22:50:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:48,567 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:50:48,585 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 41 treesize of output 39 [2019-11-19 22:50:48,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:48,719 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-11-19 22:50:48,719 INFO L567 ElimStorePlain]: treesize reduction 27, result has 56.5 percent of original size [2019-11-19 22:50:48,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:50:48,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:48,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:48,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:50:48,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:24 [2019-11-19 22:50:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-19 22:50:51,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [331393425] [2019-11-19 22:50:51,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:50:51,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-19 22:50:51,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286139983] [2019-11-19 22:50:51,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:50:51,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:50:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:50:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=90, Unknown=2, NotChecked=0, Total=132 [2019-11-19 22:50:51,192 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 12 states. [2019-11-19 22:50:51,917 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-11-19 22:50:52,424 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-11-19 22:50:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:50:53,472 INFO L93 Difference]: Finished difference Result 191 states and 214 transitions. [2019-11-19 22:50:53,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:50:53,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-11-19 22:50:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:50:53,478 INFO L225 Difference]: With dead ends: 191 [2019-11-19 22:50:53,478 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 22:50:53,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 29 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=76, Invalid=132, Unknown=2, NotChecked=0, Total=210 [2019-11-19 22:50:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 22:50:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 111. [2019-11-19 22:50:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 22:50:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-11-19 22:50:53,483 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 43 [2019-11-19 22:50:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:50:53,483 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-11-19 22:50:53,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:50:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-11-19 22:50:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 22:50:53,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:50:53,486 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:50:53,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:53,687 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:50:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:50:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1777949011, now seen corresponding path program 1 times [2019-11-19 22:50:53,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:50:53,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [598992494] [2019-11-19 22:50:53,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:50:54,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-19 22:50:54,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:50:54,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:50:54,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:54,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:54,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:50:54,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 22:50:54,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:50:54,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:54,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:54,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:50:54,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-11-19 22:50:54,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-19 22:50:54,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:54,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:54,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:50:54,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:51 [2019-11-19 22:50:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:50:55,414 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:50:55,937 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 97 treesize of output 91 [2019-11-19 22:50:55,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:55,989 INFO L567 ElimStorePlain]: treesize reduction 53, result has 28.4 percent of original size [2019-11-19 22:50:55,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:50:55,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:21 [2019-11-19 22:50:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:50:57,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [598992494] [2019-11-19 22:50:57,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:50:57,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-11-19 22:50:57,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383894398] [2019-11-19 22:50:57,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-19 22:50:57,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:50:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-19 22:50:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-11-19 22:50:57,600 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 32 states. [2019-11-19 22:50:59,860 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-19 22:51:00,078 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-19 22:51:00,407 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-19 22:51:01,090 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-19 22:51:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:51:02,639 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2019-11-19 22:51:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-19 22:51:02,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-11-19 22:51:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:51:02,641 INFO L225 Difference]: With dead ends: 182 [2019-11-19 22:51:02,641 INFO L226 Difference]: Without dead ends: 161 [2019-11-19 22:51:02,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=418, Invalid=2032, Unknown=0, NotChecked=0, Total=2450 [2019-11-19 22:51:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-19 22:51:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2019-11-19 22:51:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-19 22:51:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2019-11-19 22:51:02,646 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 47 [2019-11-19 22:51:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:51:02,646 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2019-11-19 22:51:02,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-19 22:51:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2019-11-19 22:51:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 22:51:02,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:51:02,647 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:51:02,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:02,855 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:51:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:51:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1479203935, now seen corresponding path program 2 times [2019-11-19 22:51:02,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:51:02,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1393482270] [2019-11-19 22:51:02,856 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:03,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:51:03,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:51:03,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 22:51:03,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:51:03,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:51:03,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:03,384 INFO L567 ElimStorePlain]: treesize reduction 6, result has 81.3 percent of original size [2019-11-19 22:51:03,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:51:03,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:26 [2019-11-19 22:51:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:51:03,804 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:51:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:04,303 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 16 [2019-11-19 22:51:04,315 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 35 treesize of output 31 [2019-11-19 22:51:04,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 22:51:04,320 INFO L567 ElimStorePlain]: treesize reduction 7, result has 53.3 percent of original size [2019-11-19 22:51:04,320 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:51:04,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:04,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:51:04,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-11-19 22:51:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:51:05,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1393482270] [2019-11-19 22:51:05,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:51:05,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-11-19 22:51:05,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584324174] [2019-11-19 22:51:05,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-19 22:51:05,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:51:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-19 22:51:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2019-11-19 22:51:05,465 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 32 states. [2019-11-19 22:51:06,861 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-11-19 22:51:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:51:08,867 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2019-11-19 22:51:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 22:51:08,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 49 [2019-11-19 22:51:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:51:08,869 INFO L225 Difference]: With dead ends: 247 [2019-11-19 22:51:08,870 INFO L226 Difference]: Without dead ends: 218 [2019-11-19 22:51:08,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 22:51:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-19 22:51:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2019-11-19 22:51:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-19 22:51:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2019-11-19 22:51:08,875 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 49 [2019-11-19 22:51:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:51:08,875 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2019-11-19 22:51:08,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-19 22:51:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2019-11-19 22:51:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 22:51:08,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:51:08,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:51:09,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:09,077 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:51:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:51:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash -426369642, now seen corresponding path program 2 times [2019-11-19 22:51:09,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:51:09,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [11744959] [2019-11-19 22:51:09,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:09,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:51:09,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:51:09,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-19 22:51:09,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:51:09,374 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_169|]} [2019-11-19 22:51:09,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:51:09,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-19 22:51:09,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:09,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:09,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:51:09,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:09,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:09,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:51:09,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-19 22:51:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:51:09,887 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:51:11,804 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-19 22:51:11,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:51:11,813 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-19 22:51:11,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:11,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:11,814 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-19 22:51:11,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:51:11,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:1 [2019-11-19 22:51:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:51:11,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [11744959] [2019-11-19 22:51:11,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:51:11,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-19 22:51:11,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598010671] [2019-11-19 22:51:11,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 22:51:11,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:51:11,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 22:51:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:51:11,829 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand 25 states. [2019-11-19 22:51:14,072 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-11-19 22:51:15,155 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-11-19 22:51:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:51:17,024 INFO L93 Difference]: Finished difference Result 525 states and 577 transitions. [2019-11-19 22:51:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 22:51:17,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2019-11-19 22:51:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:51:17,029 INFO L225 Difference]: With dead ends: 525 [2019-11-19 22:51:17,029 INFO L226 Difference]: Without dead ends: 525 [2019-11-19 22:51:17,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 22:51:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-19 22:51:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 257. [2019-11-19 22:51:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-19 22:51:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 287 transitions. [2019-11-19 22:51:17,042 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 287 transitions. Word has length 51 [2019-11-19 22:51:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:51:17,043 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 287 transitions. [2019-11-19 22:51:17,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 22:51:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 287 transitions. [2019-11-19 22:51:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:51:17,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:51:17,044 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:51:17,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:17,250 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION]=== [2019-11-19 22:51:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:51:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1427061148, now seen corresponding path program 3 times [2019-11-19 22:51:17,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:51:17,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [636139474] [2019-11-19 22:51:17,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fc7ca97-6add-4b97-888f-17514b4175bf/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:17,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 22:51:17,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:51:17,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-19 22:51:17,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:51:17,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:51:17,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:17,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:17,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:51:17,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-19 22:51:17,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-19 22:51:17,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:17,957 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-19 22:51:17,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:51:17,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2019-11-19 22:51:18,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-19 22:51:18,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:51:18,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:18,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:51:18,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:44 [2019-11-19 22:51:18,770 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-19 22:51:19,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:51:19,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:51:19,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2019-11-19 22:51:19,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:51:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:19,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:51:19,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:19,056 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-19 22:51:19,200 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-19 22:51:19,200 INFO L567 ElimStorePlain]: treesize reduction 9, result has 83.6 percent of original size [2019-11-19 22:51:19,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:51:19,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:62, output treesize:16 [2019-11-19 22:51:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 22:51:19,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:51:19,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:19,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:51:20,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:51:20,806 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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-19 22:51:20,809 INFO L168 Benchmark]: Toolchain (without parser) took 191431.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -337.7 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:51:20,809 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:51:20,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:51:20,810 INFO L168 Benchmark]: Boogie Preprocessor took 78.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:51:20,810 INFO L168 Benchmark]: RCFGBuilder took 792.59 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:51:20,811 INFO L168 Benchmark]: TraceAbstraction took 189852.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:51:20,812 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 792.59 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189852.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...