./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-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_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 05:36:54,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:36:54,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:36:54,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:36:54,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:36:54,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:36:54,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:36:54,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:36:54,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:36:54,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:36:54,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:36:54,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:36:54,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:36:54,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:36:54,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:36:54,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:36:54,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:36:54,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:36:54,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:36:54,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:36:54,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:36:54,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:36:54,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:36:54,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:36:54,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:36:54,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:36:54,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:36:54,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:36:54,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:36:54,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:36:54,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:36:54,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:36:54,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:36:54,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:36:54,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:36:54,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:36:54,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:36:54,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:36:54,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:36:54,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:36:54,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:36:54,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 05:36:55,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:36:55,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:36:55,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:36:55,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:36:55,008 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:36:55,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:36:55,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 05:36:55,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 05:36:55,010 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 05:36:55,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:36:55,010 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 05:36:55,010 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 05:36:55,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:36:55,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:36:55,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:36:55,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:36:55,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:36:55,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:36:55,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:36:55,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:36:55,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:36:55,012 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 05:36:55,012 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 05:36:55,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 05:36:55,013 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_c910ce79-fb14-4641-93f8-f1cd104fa089/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2019-11-20 05:36:55,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:36:55,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:36:55,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:36:55,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:36:55,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:36:55,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-20 05:36:55,230 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/data/4c1fdce53/56de0cfd34514547818afd7683eccedc/FLAGecf1f88f1 [2019-11-20 05:36:55,692 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:36:55,692 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-20 05:36:55,711 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/data/4c1fdce53/56de0cfd34514547818afd7683eccedc/FLAGecf1f88f1 [2019-11-20 05:36:55,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/data/4c1fdce53/56de0cfd34514547818afd7683eccedc [2019-11-20 05:36:55,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:36:55,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 05:36:55,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:36:55,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:36:55,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:36:55,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:55" (1/1) ... [2019-11-20 05:36:55,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48595b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:55, skipping insertion in model container [2019-11-20 05:36:55,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:55" (1/1) ... [2019-11-20 05:36:56,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:36:56,036 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:36:56,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:36:56,443 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:36:56,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:36:56,550 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:36:56,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56 WrapperNode [2019-11-20 05:36:56,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:36:56,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:36:56,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:36:56,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:36:56,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:36:56,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:36:56,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:36:56,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:36:56,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:36:56,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 05:36:56,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-11-20 05:36:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 05:36:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 05:36:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 05:36:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 05:36:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 05:36:56,684 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 05:36:56,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 05:36:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 05:36:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 05:36:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 05:36:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 05:36:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 05:36:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 05:36:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 05:36:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 05:36:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 05:36:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 05:36:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 05:36:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 05:36:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 05:36:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 05:36:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:36:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 05:36:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 05:36:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:36:57,416 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 05:36:57,449 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:36:57,449 INFO L285 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-20 05:36:57,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:57 BoogieIcfgContainer [2019-11-20 05:36:57,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:36:57,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:36:57,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:36:57,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:36:57,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:36:55" (1/3) ... [2019-11-20 05:36:57,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f728709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:57, skipping insertion in model container [2019-11-20 05:36:57,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (2/3) ... [2019-11-20 05:36:57,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f728709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:57, skipping insertion in model container [2019-11-20 05:36:57,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:57" (3/3) ... [2019-11-20 05:36:57,457 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-11-20 05:36:57,467 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:36:57,473 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-11-20 05:36:57,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-11-20 05:36:57,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:36:57,502 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 05:36:57,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:36:57,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:36:57,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:36:57,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:36:57,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:36:57,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:36:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-20 05:36:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:36:57,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:36:57,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:36:57,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:36:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:36:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 336039556, now seen corresponding path program 1 times [2019-11-20 05:36:57,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:36:57,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [399614008] [2019-11-20 05:36:57,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:57,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:36:57,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:36:57,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:36:57,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:57,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:57,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:36:57,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:36:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:57,825 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:36:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:57,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399614008] [2019-11-20 05:36:57,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:36:57,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 05:36:57,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979724858] [2019-11-20 05:36:57,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:36:57,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:36:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:36:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:36:57,859 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-20 05:36:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:36:58,065 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-11-20 05:36:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:36:58,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 05:36:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:36:58,080 INFO L225 Difference]: With dead ends: 143 [2019-11-20 05:36:58,080 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 05:36:58,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:36:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 05:36:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-20 05:36:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 05:36:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-11-20 05:36:58,160 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2019-11-20 05:36:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:36:58,161 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-11-20 05:36:58,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:36:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-11-20 05:36:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:36:58,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:36:58,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:36:58,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:58,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:36:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:36:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 336039557, now seen corresponding path program 1 times [2019-11-20 05:36:58,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:36:58,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [862213801] [2019-11-20 05:36:58,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:58,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:36:58,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:36:58,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:36:58,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:58,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:58,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:36:58,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 05:36:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:58,567 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:36:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:58,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [862213801] [2019-11-20 05:36:58,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:36:58,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 05:36:58,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000542509] [2019-11-20 05:36:58,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:36:58,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:36:58,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:36:58,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:36:58,623 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 4 states. [2019-11-20 05:36:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:36:58,740 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-20 05:36:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:36:58,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 05:36:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:36:58,743 INFO L225 Difference]: With dead ends: 133 [2019-11-20 05:36:58,743 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 05:36:58,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:36:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 05:36:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-20 05:36:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 05:36:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-20 05:36:58,754 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2019-11-20 05:36:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:36:58,754 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-20 05:36:58,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:36:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-20 05:36:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:36:58,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:36:58,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:36:58,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:58,962 INFO L410 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:36:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:36:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452530, now seen corresponding path program 1 times [2019-11-20 05:36:58,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:36:58,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [514017379] [2019-11-20 05:36:58,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:59,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:36:59,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:36:59,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:59,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 05:36:59,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,233 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 05:36:59,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:36:59,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 05:36:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:59,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:36:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:59,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514017379] [2019-11-20 05:36:59,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:36:59,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-20 05:36:59,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910565562] [2019-11-20 05:36:59,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:36:59,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:36:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:36:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:36:59,255 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 4 states. [2019-11-20 05:36:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:36:59,472 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-11-20 05:36:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:36:59,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 05:36:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:36:59,476 INFO L225 Difference]: With dead ends: 140 [2019-11-20 05:36:59,476 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 05:36:59,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:36:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 05:36:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2019-11-20 05:36:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 05:36:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2019-11-20 05:36:59,488 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 15 [2019-11-20 05:36:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:36:59,489 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2019-11-20 05:36:59,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:36:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2019-11-20 05:36:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:36:59,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:36:59,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:36:59,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:59,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:36:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:36:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452529, now seen corresponding path program 1 times [2019-11-20 05:36:59,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:36:59,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [531248885] [2019-11-20 05:36:59,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:36:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:59,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:36:59,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:36:59,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:36:59,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:59,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 05:36:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:59,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:36:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:36:59,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [531248885] [2019-11-20 05:36:59,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:36:59,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 05:36:59,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492836116] [2019-11-20 05:36:59,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:36:59,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:36:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:36:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:36:59,981 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 4 states. [2019-11-20 05:37:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:00,116 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-20 05:37:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:00,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 05:37:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:00,123 INFO L225 Difference]: With dead ends: 139 [2019-11-20 05:37:00,123 INFO L226 Difference]: Without dead ends: 139 [2019-11-20 05:37:00,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:37:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-20 05:37:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2019-11-20 05:37:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-20 05:37:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-20 05:37:00,132 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 15 [2019-11-20 05:37:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:00,133 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-20 05:37:00,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:37:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-20 05:37:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:37:00,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:00,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:00,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:00,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454067, now seen corresponding path program 1 times [2019-11-20 05:37:00,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:00,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [852558250] [2019-11-20 05:37:00,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:00,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:37:00,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:00,573 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:00,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852558250] [2019-11-20 05:37:00,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:00,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 05:37:00,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610658134] [2019-11-20 05:37:00,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:37:00,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:37:00,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:37:00,618 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 8 states. [2019-11-20 05:37:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:00,690 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-11-20 05:37:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:37:00,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-20 05:37:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:00,692 INFO L225 Difference]: With dead ends: 139 [2019-11-20 05:37:00,692 INFO L226 Difference]: Without dead ends: 139 [2019-11-20 05:37:00,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:37:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-20 05:37:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-11-20 05:37:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-20 05:37:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2019-11-20 05:37:00,701 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 15 [2019-11-20 05:37:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:00,701 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2019-11-20 05:37:00,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:37:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2019-11-20 05:37:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:37:00,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:00,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:00,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:00,905 INFO L410 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1680513840, now seen corresponding path program 1 times [2019-11-20 05:37:00,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:00,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [131758638] [2019-11-20 05:37:00,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:01,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:37:01,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:01,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:01,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:37:01,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 05:37:01,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,148 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 05:37:01,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:01,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 05:37:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:01,156 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:01,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [131758638] [2019-11-20 05:37:01,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:01,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 05:37:01,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291284743] [2019-11-20 05:37:01,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:37:01,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:37:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:37:01,180 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 4 states. [2019-11-20 05:37:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:01,367 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2019-11-20 05:37:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:37:01,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 05:37:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:01,369 INFO L225 Difference]: With dead ends: 138 [2019-11-20 05:37:01,369 INFO L226 Difference]: Without dead ends: 138 [2019-11-20 05:37:01,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:37:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-20 05:37:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-11-20 05:37:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-20 05:37:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2019-11-20 05:37:01,387 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 16 [2019-11-20 05:37:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:01,387 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2019-11-20 05:37:01,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:37:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2019-11-20 05:37:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:37:01,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:01,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:01,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:01,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1680513841, now seen corresponding path program 1 times [2019-11-20 05:37:01,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:01,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [338980797] [2019-11-20 05:37:01,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:01,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:37:01,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:01,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:01,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:01,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 05:37:01,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 05:37:01,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 05:37:01,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:01,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:01,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:01,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-20 05:37:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:01,911 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:01,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338980797] [2019-11-20 05:37:02,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:02,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 05:37:02,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162453526] [2019-11-20 05:37:02,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:37:02,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:37:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:37:02,236 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 8 states. [2019-11-20 05:37:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:03,001 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-11-20 05:37:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:37:03,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-20 05:37:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:03,002 INFO L225 Difference]: With dead ends: 137 [2019-11-20 05:37:03,002 INFO L226 Difference]: Without dead ends: 137 [2019-11-20 05:37:03,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:37:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-20 05:37:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-20 05:37:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-20 05:37:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2019-11-20 05:37:03,007 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 16 [2019-11-20 05:37:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:03,007 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2019-11-20 05:37:03,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:37:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2019-11-20 05:37:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:37:03,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:03,008 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:03,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:03,211 INFO L410 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2121717530, now seen corresponding path program 1 times [2019-11-20 05:37:03,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:03,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349440631] [2019-11-20 05:37:03,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:03,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:37:03,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:03,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:03,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 05:37:03,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:03,454 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 05:37:03,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:03,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 05:37:03,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:03,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 05:37:03,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:03,499 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 05:37:03,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:03,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 05:37:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:03,507 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:03,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349440631] [2019-11-20 05:37:03,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:03,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-20 05:37:03,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959652395] [2019-11-20 05:37:03,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:37:03,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:03,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:37:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:37:03,532 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 5 states. [2019-11-20 05:37:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:03,667 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-11-20 05:37:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:37:03,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 05:37:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:03,668 INFO L225 Difference]: With dead ends: 135 [2019-11-20 05:37:03,668 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 05:37:03,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:37:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 05:37:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-20 05:37:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-20 05:37:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-11-20 05:37:03,673 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 21 [2019-11-20 05:37:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:03,673 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-11-20 05:37:03,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:37:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-11-20 05:37:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:37:03,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:03,674 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:03,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:03,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2121717531, now seen corresponding path program 1 times [2019-11-20 05:37:03,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:03,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [321357345] [2019-11-20 05:37:03,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:04,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:37:04,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:04,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:04,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:04,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:04,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:04,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:04,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:04,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:04,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 05:37:04,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:04,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 05:37:04,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:04,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:04,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 05:37:04,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:04,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:04,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:04,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-20 05:37:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:04,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:04,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:04,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [321357345] [2019-11-20 05:37:04,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:04,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 05:37:04,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363415190] [2019-11-20 05:37:04,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:37:04,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:04,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:37:04,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:37:04,444 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 8 states. [2019-11-20 05:37:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:05,091 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-20 05:37:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:37:05,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 05:37:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:05,093 INFO L225 Difference]: With dead ends: 133 [2019-11-20 05:37:05,093 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 05:37:05,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:37:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 05:37:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-20 05:37:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 05:37:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-20 05:37:05,099 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2019-11-20 05:37:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:05,099 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-20 05:37:05,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:37:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-20 05:37:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 05:37:05,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:05,100 INFO L410 BasicCegarLoop]: trace histogram [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-20 05:37:05,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:05,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479222, now seen corresponding path program 1 times [2019-11-20 05:37:05,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:05,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1122095179] [2019-11-20 05:37:05,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:05,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 05:37:05,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:05,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:05,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:05,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:05,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:05,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:37:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:05,589 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:05,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1122095179] [2019-11-20 05:37:05,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:05,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-20 05:37:05,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856014187] [2019-11-20 05:37:05,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 05:37:05,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 05:37:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:37:05,731 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 9 states. [2019-11-20 05:37:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:06,169 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-11-20 05:37:06,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:37:06,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-11-20 05:37:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:06,171 INFO L225 Difference]: With dead ends: 130 [2019-11-20 05:37:06,171 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 05:37:06,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:37:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 05:37:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-20 05:37:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 05:37:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2019-11-20 05:37:06,175 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2019-11-20 05:37:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:06,176 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2019-11-20 05:37:06,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 05:37:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2019-11-20 05:37:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 05:37:06,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:06,177 INFO L410 BasicCegarLoop]: trace histogram [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-20 05:37:06,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:06,380 INFO L410 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479221, now seen corresponding path program 1 times [2019-11-20 05:37:06,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:06,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2023092606] [2019-11-20 05:37:06,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:06,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 05:37:06,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:06,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:06,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:06,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:06,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:06,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 05:37:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:06,800 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2023092606] [2019-11-20 05:37:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 05:37:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590434022] [2019-11-20 05:37:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 05:37:07,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 05:37:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:37:07,386 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 16 states. [2019-11-20 05:37:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:08,537 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-11-20 05:37:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:37:08,537 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-20 05:37:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:08,538 INFO L225 Difference]: With dead ends: 123 [2019-11-20 05:37:08,539 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 05:37:08,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:37:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 05:37:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-11-20 05:37:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-20 05:37:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-11-20 05:37:08,543 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2019-11-20 05:37:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:08,543 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-11-20 05:37:08,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 05:37:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-11-20 05:37:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:37:08,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:08,545 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-20 05:37:08,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:08,750 INFO L410 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1282426124, now seen corresponding path program 1 times [2019-11-20 05:37:08,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:08,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978110251] [2019-11-20 05:37:08,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:09,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 05:37:09,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:09,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:09,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 05:37:09,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 05:37:09,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-11-20 05:37:09,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 05:37:09,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 05:37:09,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 05:37:09,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:09,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-20 05:37:09,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-20 05:37:09,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,324 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2019-11-20 05:37:09,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:09,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-20 05:37:09,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:09,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 52 [2019-11-20 05:37:09,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,447 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-20 05:37:09,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:09,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-11-20 05:37:09,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-11-20 05:37:09,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:09,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:09,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-11-20 05:37:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:09,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:10,361 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 05:37:10,554 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 05:37:10,784 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 05:37:11,044 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 05:37:11,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:11,724 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-20 05:37:11,724 INFO L567 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-11-20 05:37:11,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:11,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 05:37:11,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:41 [2019-11-20 05:37:11,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:11,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978110251] [2019-11-20 05:37:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:12,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-11-20 05:37:12,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810679041] [2019-11-20 05:37:12,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 05:37:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 05:37:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-20 05:37:12,196 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 32 states. [2019-11-20 05:37:13,695 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-11-20 05:37:13,880 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-11-20 05:37:14,241 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-11-20 05:37:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:15,614 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-11-20 05:37:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 05:37:15,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-11-20 05:37:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:15,616 INFO L225 Difference]: With dead ends: 123 [2019-11-20 05:37:15,616 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 05:37:15,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=299, Invalid=1863, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 05:37:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 05:37:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-11-20 05:37:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-20 05:37:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2019-11-20 05:37:15,621 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 38 [2019-11-20 05:37:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:15,621 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2019-11-20 05:37:15,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 05:37:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2019-11-20 05:37:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:37:15,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:15,622 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-20 05:37:15,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:15,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1282424908, now seen corresponding path program 1 times [2019-11-20 05:37:15,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:15,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1785000793] [2019-11-20 05:37:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:16,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 05:37:16,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:16,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:37:16,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:16,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:16,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:16,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 05:37:16,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 05:37:16,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:16,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:16,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:16,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 05:37:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:16,250 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 05:37:16,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785000793] [2019-11-20 05:37:16,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:16,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2019-11-20 05:37:16,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315943904] [2019-11-20 05:37:16,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 05:37:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 05:37:16,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:37:16,547 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 19 states. [2019-11-20 05:37:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:17,251 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-11-20 05:37:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:37:17,252 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-11-20 05:37:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:17,253 INFO L225 Difference]: With dead ends: 114 [2019-11-20 05:37:17,253 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 05:37:17,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2019-11-20 05:37:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 05:37:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-20 05:37:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 05:37:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-11-20 05:37:17,256 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 38 [2019-11-20 05:37:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:17,256 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-11-20 05:37:17,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 05:37:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-11-20 05:37:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:37:17,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:17,257 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-20 05:37:17,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:17,458 INFO L410 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1282463890, now seen corresponding path program 1 times [2019-11-20 05:37:17,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:17,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [915028174] [2019-11-20 05:37:17,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:17,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:37:17,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:17,806 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:17,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915028174] [2019-11-20 05:37:17,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:17,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-20 05:37:17,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028106391] [2019-11-20 05:37:17,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 05:37:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 05:37:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:37:17,955 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 17 states. [2019-11-20 05:37:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:18,672 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-20 05:37:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:37:18,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-20 05:37:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:18,673 INFO L225 Difference]: With dead ends: 109 [2019-11-20 05:37:18,673 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 05:37:18,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:37:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 05:37:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-20 05:37:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 05:37:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-20 05:37:18,677 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 38 [2019-11-20 05:37:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:18,677 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-20 05:37:18,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 05:37:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-20 05:37:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 05:37:18,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:18,678 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-20 05:37:18,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:18,879 INFO L410 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1100504094, now seen corresponding path program 1 times [2019-11-20 05:37:18,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:18,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [345652047] [2019-11-20 05:37:18,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:19,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 05:37:19,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:19,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:37:19,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 05:37:19,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 05:37:19,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2019-11-20 05:37:19,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 05:37:19,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-20 05:37:19,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,429 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 55 [2019-11-20 05:37:19,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:19,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:19,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-20 05:37:19,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2019-11-20 05:37:19,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,632 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.3 percent of original size [2019-11-20 05:37:19,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:19,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-11-20 05:37:19,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:19,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:19,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 111 [2019-11-20 05:37:19,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:19,802 INFO L567 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2019-11-20 05:37:19,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:19,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:58 [2019-11-20 05:37:20,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:20,407 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-11-20 05:37:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:20,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:20,424 INFO L567 ElimStorePlain]: treesize reduction 11, result has 50.0 percent of original size [2019-11-20 05:37:20,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:20,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-11-20 05:37:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:20,533 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:21,107 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 05:37:21,259 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 05:37:21,477 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 05:37:21,618 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 05:37:21,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:37:21,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:37:21,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:21,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:37:21,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:21,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:21,714 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_129| vanished before elimination [2019-11-20 05:37:21,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:21,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:93, output treesize:1 [2019-11-20 05:37:22,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:22,388 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-11-20 05:37:22,388 INFO L567 ElimStorePlain]: treesize reduction 50, result has 32.4 percent of original size [2019-11-20 05:37:22,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:22,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:22,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 05:37:22,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:28 [2019-11-20 05:37:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:22,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:22,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:37:22,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:22,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-20 05:37:22,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:22,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 05:37:22,756 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 05:37:22,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:22,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:11 [2019-11-20 05:37:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:22,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [345652047] [2019-11-20 05:37:22,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:22,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-11-20 05:37:22,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418717693] [2019-11-20 05:37:22,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 05:37:22,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 05:37:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 05:37:22,924 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 36 states. [2019-11-20 05:37:24,583 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-20 05:37:27,419 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-11-20 05:37:27,719 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-20 05:37:28,336 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-20 05:37:28,678 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-20 05:37:29,028 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-20 05:37:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:32,345 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-20 05:37:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 05:37:32,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-11-20 05:37:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:32,347 INFO L225 Difference]: With dead ends: 109 [2019-11-20 05:37:32,347 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 05:37:32,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=335, Invalid=2317, Unknown=0, NotChecked=0, Total=2652 [2019-11-20 05:37:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 05:37:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-11-20 05:37:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 05:37:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-11-20 05:37:32,351 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 39 [2019-11-20 05:37:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:32,352 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-11-20 05:37:32,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 05:37:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-11-20 05:37:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 05:37:32,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:32,360 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-20 05:37:32,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:32,567 INFO L410 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1100466360, now seen corresponding path program 1 times [2019-11-20 05:37:32,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:32,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [205834925] [2019-11-20 05:37:32,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:32,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:37:32,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:32,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:37:32,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:32,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:32,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:32,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-20 05:37:33,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 05:37:33,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:33,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:33,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:33,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 05:37:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:33,102 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 05:37:33,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [205834925] [2019-11-20 05:37:33,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:33,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2019-11-20 05:37:33,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548912712] [2019-11-20 05:37:33,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 05:37:33,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:33,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 05:37:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:37:33,497 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 23 states. [2019-11-20 05:37:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:35,135 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-20 05:37:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 05:37:35,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-20 05:37:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:35,136 INFO L225 Difference]: With dead ends: 100 [2019-11-20 05:37:35,137 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 05:37:35,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-11-20 05:37:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 05:37:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-20 05:37:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 05:37:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-20 05:37:35,140 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 39 [2019-11-20 05:37:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:35,140 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-20 05:37:35,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 05:37:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-20 05:37:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:37:35,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:35,141 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-20 05:37:35,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:35,345 INFO L410 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 244111542, now seen corresponding path program 1 times [2019-11-20 05:37:35,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:35,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [942333052] [2019-11-20 05:37:35,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:35,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 05:37:35,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:35,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 05:37:35,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,649 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 05:37:35,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-20 05:37:35,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 05:37:35,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-11-20 05:37:35,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 05:37:35,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 05:37:35,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,764 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-20 05:37:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:35,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:35,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2019-11-20 05:37:35,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:35,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2019-11-20 05:37:35,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:35,971 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-11-20 05:37:35,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:35,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-11-20 05:37:36,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:36,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:36,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 115 [2019-11-20 05:37:36,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:36,247 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-20 05:37:36,248 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.9 percent of original size [2019-11-20 05:37:36,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:36,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:59 [2019-11-20 05:37:36,930 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 05:37:36,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:36,931 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-11-20 05:37:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:36,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:36,958 INFO L567 ElimStorePlain]: treesize reduction 42, result has 22.2 percent of original size [2019-11-20 05:37:36,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:36,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:7 [2019-11-20 05:37:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:37,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:38,114 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-20 05:37:38,284 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 05:37:38,525 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:37:38,733 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:37:39,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:39,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2019-11-20 05:37:39,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:39,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:39,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:39,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:39,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:35 [2019-11-20 05:37:39,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:39,284 INFO L567 ElimStorePlain]: treesize reduction 29, result has 29.3 percent of original size [2019-11-20 05:37:39,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:39,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2019-11-20 05:37:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:39,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942333052] [2019-11-20 05:37:39,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:39,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2019-11-20 05:37:39,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901436532] [2019-11-20 05:37:39,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 05:37:39,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 05:37:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 05:37:39,576 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 33 states. [2019-11-20 05:37:41,124 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-11-20 05:37:41,976 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 05:37:42,210 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 05:37:42,590 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-20 05:37:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:43,912 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-20 05:37:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 05:37:43,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-11-20 05:37:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:43,915 INFO L225 Difference]: With dead ends: 103 [2019-11-20 05:37:43,915 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 05:37:43,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=372, Invalid=2078, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 05:37:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 05:37:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-20 05:37:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 05:37:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-20 05:37:43,919 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-11-20 05:37:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:43,919 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-20 05:37:43,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 05:37:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-20 05:37:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:37:43,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:43,920 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-20 05:37:44,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:44,121 INFO L410 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash 245281334, now seen corresponding path program 1 times [2019-11-20 05:37:44,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:44,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1968472807] [2019-11-20 05:37:44,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:44,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 05:37:44,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:44,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 05:37:44,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:44,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-20 05:37:44,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:37:44,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:44,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-20 05:37:44,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 05:37:44,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:44,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:44,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2019-11-20 05:37:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:37:44,527 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 05:37:44,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968472807] [2019-11-20 05:37:44,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:44,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2019-11-20 05:37:44,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141573584] [2019-11-20 05:37:44,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 05:37:44,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 05:37:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:37:44,951 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 20 states. [2019-11-20 05:37:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:45,924 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-11-20 05:37:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:37:45,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-20 05:37:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:45,925 INFO L225 Difference]: With dead ends: 98 [2019-11-20 05:37:45,925 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 05:37:45,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-11-20 05:37:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 05:37:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-20 05:37:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 05:37:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-20 05:37:45,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 40 [2019-11-20 05:37:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:45,928 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-20 05:37:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 05:37:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-20 05:37:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:37:45,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:45,929 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:46,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:46,133 INFO L410 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2033890821, now seen corresponding path program 1 times [2019-11-20 05:37:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [790132229] [2019-11-20 05:37:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:46,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 05:37:46,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:46,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 05:37:46,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:46,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-20 05:37:46,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:46,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 05:37:46,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:46,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-20 05:37:46,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:37:46,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:46,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-11-20 05:37:46,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 05:37:46,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:46,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:10 [2019-11-20 05:37:46,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 05:37:46,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:46,778 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 05:37:46,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:46,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 05:37:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:46,867 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:47,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 05:37:47,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:47,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:47,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:47,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 05:37:47,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:47,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-20 05:37:47,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:47,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:47,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:47,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:47,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 05:37:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:47,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790132229] [2019-11-20 05:37:47,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:47,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2019-11-20 05:37:47,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554243752] [2019-11-20 05:37:47,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 05:37:47,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 05:37:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-11-20 05:37:47,889 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 26 states. [2019-11-20 05:37:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:49,289 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-20 05:37:49,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 05:37:49,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-11-20 05:37:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:49,290 INFO L225 Difference]: With dead ends: 97 [2019-11-20 05:37:49,290 INFO L226 Difference]: Without dead ends: 97 [2019-11-20 05:37:49,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 05:37:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-20 05:37:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-20 05:37:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 05:37:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-20 05:37:49,293 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2019-11-20 05:37:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:49,294 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-20 05:37:49,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 05:37:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-20 05:37:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:37:49,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:49,294 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:49,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:49,495 INFO L410 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:37:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2033459845, now seen corresponding path program 1 times [2019-11-20 05:37:49,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:37:49,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950142288] [2019-11-20 05:37:49,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:37:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:49,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 05:37:49,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:37:49,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:49,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 05:37:49,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,860 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 05:37:49,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-20 05:37:49,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:49,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 05:37:49,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:49,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-11-20 05:37:49,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 05:37:49,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:49,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:49,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 05:37:49,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:49,978 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-20 05:37:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:49,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 05:37:50,020 INFO L567 ElimStorePlain]: treesize reduction 40, result has 50.6 percent of original size [2019-11-20 05:37:50,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:50,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2019-11-20 05:37:50,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:50,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2019-11-20 05:37:50,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:50,176 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-11-20 05:37:50,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:50,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-11-20 05:37:50,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:50,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:50,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 115 [2019-11-20 05:37:50,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:50,328 INFO L567 ElimStorePlain]: treesize reduction 68, result has 45.2 percent of original size [2019-11-20 05:37:50,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:50,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:59 [2019-11-20 05:37:50,829 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 05:37:50,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:50,829 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-11-20 05:37:50,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:50,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:50,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:50,852 INFO L567 ElimStorePlain]: treesize reduction 42, result has 19.2 percent of original size [2019-11-20 05:37:50,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:37:50,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:10 [2019-11-20 05:37:50,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 05:37:50,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:50,990 INFO L567 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-11-20 05:37:50,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:50,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2019-11-20 05:37:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:51,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:37:51,779 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-20 05:37:51,926 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 05:37:52,114 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:37:52,310 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:37:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:52,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 43 treesize of output 41 [2019-11-20 05:37:52,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:52,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:52,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2019-11-20 05:37:52,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:52,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:52,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:52,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 05:37:52,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:72 [2019-11-20 05:37:53,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:37:53,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:53,290 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.6 percent of original size [2019-11-20 05:37:53,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 05:37:53,337 INFO L567 ElimStorePlain]: treesize reduction 30, result has 43.4 percent of original size [2019-11-20 05:37:53,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 05:37:53,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:9 [2019-11-20 05:37:53,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:53,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950142288] [2019-11-20 05:37:53,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:53,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2019-11-20 05:37:53,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184399936] [2019-11-20 05:37:53,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-20 05:37:53,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:37:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 05:37:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 05:37:53,534 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 34 states. [2019-11-20 05:37:54,703 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-20 05:37:54,991 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-11-20 05:37:57,951 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 05:37:58,169 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 05:37:58,521 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 05:38:01,210 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 05:38:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:01,994 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-20 05:38:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 05:38:01,995 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-11-20 05:38:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:01,995 INFO L225 Difference]: With dead ends: 100 [2019-11-20 05:38:01,996 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 05:38:01,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=352, Invalid=2300, Unknown=0, NotChecked=0, Total=2652 [2019-11-20 05:38:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 05:38:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-11-20 05:38:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 05:38:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-11-20 05:38:01,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2019-11-20 05:38:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:01,999 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-11-20 05:38:01,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-20 05:38:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-11-20 05:38:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:38:02,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:02,000 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:02,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:38:02,204 INFO L410 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 05:38:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash -694753286, now seen corresponding path program 1 times [2019-11-20 05:38:02,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:38:02,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1244688219] [2019-11-20 05:38:02,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c910ce79-fb14-4641-93f8-f1cd104fa089/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:38:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:02,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 05:38:02,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:38:02,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 05:38:02,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:38:02,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 05:38:02,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,574 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-20 05:38:02,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-20 05:38:02,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 18 treesize of output 28 [2019-11-20 05:38:02,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2019-11-20 05:38:02,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 05:38:02,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 05:38:02,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,741 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-11-20 05:38:02,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:02,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:02,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:02,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 05:38:02,815 INFO L567 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size [2019-11-20 05:38:02,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:02,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-20 05:38:02,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:02,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 82 [2019-11-20 05:38:02,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:02,987 INFO L567 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-11-20 05:38:02,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:02,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2019-11-20 05:38:03,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:03,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:03,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 112 [2019-11-20 05:38:03,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:03,166 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-20 05:38:03,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:03,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:73 [2019-11-20 05:38:03,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:03,879 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 104 [2019-11-20 05:38:03,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:03,905 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-20 05:38:03,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:03,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:10 [2019-11-20 05:38:04,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 05:38:04,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:04,022 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 05:38:04,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:04,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 05:38:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:04,087 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:38:05,122 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-20 05:38:05,435 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 05:38:05,722 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 05:38:06,007 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 05:38:06,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:06,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 05:38:06,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:06,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:06,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:06,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-20 05:38:06,800 INFO L343 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2019-11-20 05:38:06,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2019-11-20 05:38:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:06,813 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:06,813 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 40 treesize of output 42 [2019-11-20 05:38:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:06,816 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_104], 2=[v_arrayElimCell_103]} [2019-11-20 05:38:07,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:38:07,023 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 05:38:07,026 INFO L168 Benchmark]: Toolchain (without parser) took 71042.46 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 254.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:38:07,026 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:38:07,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:38:07,026 INFO L168 Benchmark]: Boogie Preprocessor took 65.95 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-20 05:38:07,027 INFO L168 Benchmark]: RCFGBuilder took 832.51 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: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:38:07,027 INFO L168 Benchmark]: TraceAbstraction took 69573.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.6 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:38:07,028 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.95 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 832.51 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: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69573.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.6 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...