./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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 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_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:23:32,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:23:32,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:23:32,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:23:32,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:23:32,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:23:32,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:23:32,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:23:32,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:23:32,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:23:32,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:23:32,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:23:32,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:23:32,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:23:32,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:23:32,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:23:32,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:23:32,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:23:32,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:23:32,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:23:32,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:23:32,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:23:32,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:23:32,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:23:32,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:23:32,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:23:32,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:23:32,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:23:32,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:23:32,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:23:32,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:23:32,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:23:32,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:23:32,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:23:32,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:23:32,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:23:32,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:23:32,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:23:32,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:23:32,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:23:32,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:23:32,429 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:23:32,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:23:32,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:23:32,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:23:32,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:23:32,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:23:32,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:23:32,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:23:32,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:23:32,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:23:32,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:23:32,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:23:32,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:23:32,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:23:32,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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-12-07 18:23:32,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:23:32,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:23:32,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:23:32,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:23:32,569 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:23:32,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 18:23:32,620 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/8b93379bc/fa145d08c51445369b81a7812f1f91d4/FLAG8c008bbc0 [2019-12-07 18:23:32,998 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:23:32,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 18:23:33,007 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/8b93379bc/fa145d08c51445369b81a7812f1f91d4/FLAG8c008bbc0 [2019-12-07 18:23:33,016 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/8b93379bc/fa145d08c51445369b81a7812f1f91d4 [2019-12-07 18:23:33,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:23:33,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:23:33,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:23:33,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:23:33,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:23:33,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbb5b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33, skipping insertion in model container [2019-12-07 18:23:33,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:23:33,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:23:33,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:23:33,255 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:23:33,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:23:33,316 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:23:33,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33 WrapperNode [2019-12-07 18:23:33,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:23:33,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:23:33,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:23:33,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:23:33,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... [2019-12-07 18:23:33,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:23:33,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:23:33,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:23:33,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:23:33,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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-12-07 18:23:33,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-12-07 18:23:33,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:23:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:23:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:23:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:23:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:23:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:23:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:23:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:23:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:23:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:23:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:23:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:23:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:23:33,728 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 18:23:33,742 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:23:33,742 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 18:23:33,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:33 BoogieIcfgContainer [2019-12-07 18:23:33,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:23:33,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:23:33,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:23:33,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:23:33,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:23:33" (1/3) ... [2019-12-07 18:23:33,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f185e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:23:33, skipping insertion in model container [2019-12-07 18:23:33,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:33" (2/3) ... [2019-12-07 18:23:33,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f185e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:23:33, skipping insertion in model container [2019-12-07 18:23:33,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:33" (3/3) ... [2019-12-07 18:23:33,748 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-12-07 18:23:33,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:23:33,759 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-12-07 18:23:33,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-12-07 18:23:33,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:23:33,779 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:23:33,779 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:23:33,779 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:23:33,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:23:33,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:23:33,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:23:33,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:23:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-12-07 18:23:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:23:33,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:33,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:33,802 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-12-07 18:23:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash 336039556, now seen corresponding path program 1 times [2019-12-07 18:23:33,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:33,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433154735] [2019-12-07 18:23:33,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:33,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-12-07 18:23:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433154735] [2019-12-07 18:23:33,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:33,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:33,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681922884] [2019-12-07 18:23:33,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:33,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:33,948 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-12-07 18:23:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:34,177 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-12-07 18:23:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:34,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:23:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:34,185 INFO L225 Difference]: With dead ends: 143 [2019-12-07 18:23:34,185 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:23:34,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:23:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-12-07 18:23:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 18:23:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-12-07 18:23:34,217 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2019-12-07 18:23:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:34,218 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-12-07 18:23:34,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-12-07 18:23:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:23:34,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:34,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:34,219 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-12-07 18:23:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 336039557, now seen corresponding path program 1 times [2019-12-07 18:23:34,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:34,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936335954] [2019-12-07 18:23:34,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:34,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936335954] [2019-12-07 18:23:34,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:34,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:34,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379152678] [2019-12-07 18:23:34,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:34,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,279 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 4 states. [2019-12-07 18:23:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:34,425 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-12-07 18:23:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:34,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:23:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:34,427 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:23:34,427 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:23:34,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:23:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-12-07 18:23:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:23:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-12-07 18:23:34,435 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2019-12-07 18:23:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:34,436 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-12-07 18:23:34,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-12-07 18:23:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:23:34,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:34,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:34,437 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-12-07 18:23:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452530, now seen corresponding path program 1 times [2019-12-07 18:23:34,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:34,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397278405] [2019-12-07 18:23:34,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:34,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397278405] [2019-12-07 18:23:34,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:34,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:34,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291943665] [2019-12-07 18:23:34,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,476 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 4 states. [2019-12-07 18:23:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:34,623 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-12-07 18:23:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:34,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:23:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:34,626 INFO L225 Difference]: With dead ends: 140 [2019-12-07 18:23:34,626 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 18:23:34,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 18:23:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2019-12-07 18:23:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 18:23:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2019-12-07 18:23:34,633 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 15 [2019-12-07 18:23:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:34,634 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2019-12-07 18:23:34,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2019-12-07 18:23:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:23:34,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:34,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:34,635 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-12-07 18:23:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:34,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452529, now seen corresponding path program 1 times [2019-12-07 18:23:34,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:34,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963946279] [2019-12-07 18:23:34,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:34,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963946279] [2019-12-07 18:23:34,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:34,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:34,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930391551] [2019-12-07 18:23:34,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:34,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,686 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 4 states. [2019-12-07 18:23:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:34,827 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-12-07 18:23:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:34,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:23:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:34,828 INFO L225 Difference]: With dead ends: 139 [2019-12-07 18:23:34,828 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 18:23:34,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 18:23:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2019-12-07 18:23:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 18:23:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-12-07 18:23:34,834 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 15 [2019-12-07 18:23:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:34,835 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-12-07 18:23:34,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-12-07 18:23:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:23:34,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:34,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:34,836 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-12-07 18:23:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454067, now seen corresponding path program 1 times [2019-12-07 18:23:34,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:34,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452579765] [2019-12-07 18:23:34,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:34,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452579765] [2019-12-07 18:23:34,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:34,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:23:34,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598643942] [2019-12-07 18:23:34,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:34,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:34,877 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 6 states. [2019-12-07 18:23:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,033 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-12-07 18:23:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:35,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 18:23:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,034 INFO L225 Difference]: With dead ends: 139 [2019-12-07 18:23:35,034 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 18:23:35,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 18:23:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-12-07 18:23:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 18:23:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-12-07 18:23:35,040 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 15 [2019-12-07 18:23:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,040 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-12-07 18:23:35,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-12-07 18:23:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:23:35,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:35,041 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-12-07 18:23:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454066, now seen corresponding path program 1 times [2019-12-07 18:23:35,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:35,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369003577] [2019-12-07 18:23:35,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369003577] [2019-12-07 18:23:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:35,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:23:35,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543457064] [2019-12-07 18:23:35,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:35,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:35,074 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 6 states. [2019-12-07 18:23:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,217 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-12-07 18:23:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:23:35,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 18:23:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,218 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:23:35,218 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:23:35,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:23:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:23:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-12-07 18:23:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:23:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-12-07 18:23:35,223 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 15 [2019-12-07 18:23:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,223 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-12-07 18:23:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-12-07 18:23:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:23:35,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:35,224 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-12-07 18:23:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1680513841, now seen corresponding path program 1 times [2019-12-07 18:23:35,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:35,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993435339] [2019-12-07 18:23:35,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993435339] [2019-12-07 18:23:35,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:35,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048357880] [2019-12-07 18:23:35,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:35,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:35,282 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 5 states. [2019-12-07 18:23:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,417 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2019-12-07 18:23:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:35,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:23:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,418 INFO L225 Difference]: With dead ends: 136 [2019-12-07 18:23:35,418 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:23:35,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:23:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-12-07 18:23:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:23:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-12-07 18:23:35,423 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 16 [2019-12-07 18:23:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,424 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-12-07 18:23:35,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-12-07 18:23:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:23:35,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:35,425 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-12-07 18:23:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -901390365, now seen corresponding path program 1 times [2019-12-07 18:23:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:35,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635542578] [2019-12-07 18:23:35,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635542578] [2019-12-07 18:23:35,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:35,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:35,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319785824] [2019-12-07 18:23:35,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:35,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:35,459 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 5 states. [2019-12-07 18:23:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,610 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-12-07 18:23:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:35,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 18:23:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,611 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:23:35,611 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:23:35,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:23:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-12-07 18:23:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:23:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-12-07 18:23:35,615 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 20 [2019-12-07 18:23:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-12-07 18:23:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-12-07 18:23:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:23:35,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:35,616 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-12-07 18:23:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -901390364, now seen corresponding path program 1 times [2019-12-07 18:23:35,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:35,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747010107] [2019-12-07 18:23:35,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747010107] [2019-12-07 18:23:35,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748453965] [2019-12-07 18:23:35,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:23:35,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:35,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-12-07 18:23:35,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160598308] [2019-12-07 18:23:35,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:35,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:35,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:35,748 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 7 states. [2019-12-07 18:23:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,917 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-12-07 18:23:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:23:35,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 18:23:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,918 INFO L225 Difference]: With dead ends: 135 [2019-12-07 18:23:35,918 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 18:23:35,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:23:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 18:23:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-12-07 18:23:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:23:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-12-07 18:23:35,922 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 20 [2019-12-07 18:23:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,922 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-12-07 18:23:35,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-12-07 18:23:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:23:35,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,923 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:36,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:36,125 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-12-07 18:23:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2121717531, now seen corresponding path program 1 times [2019-12-07 18:23:36,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:36,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859480698] [2019-12-07 18:23:36,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:36,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859480698] [2019-12-07 18:23:36,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143517143] [2019-12-07 18:23:36,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:23:36,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:36,300 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-12-07 18:23:36,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:36,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:36,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:36,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:23:36,325 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:36,325 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-12-07 18:23:36,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:36,337 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 18:23:36,338 INFO L534 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-12-07 18:23:36,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-12-07 18:23:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:36,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:36,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 18:23:36,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030509434] [2019-12-07 18:23:36,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:36,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:36,346 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 6 states. [2019-12-07 18:23:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:36,497 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-12-07 18:23:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:36,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 18:23:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:36,498 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:23:36,498 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:23:36,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:23:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-12-07 18:23:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:23:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-12-07 18:23:36,502 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2019-12-07 18:23:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-12-07 18:23:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-12-07 18:23:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:36,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:36,503 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-12-07 18:23:36,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:36,703 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-12-07 18:23:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479222, now seen corresponding path program 1 times [2019-12-07 18:23:36,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:36,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129374715] [2019-12-07 18:23:36,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:23:36,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129374715] [2019-12-07 18:23:36,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:36,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:36,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031513785] [2019-12-07 18:23:36,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:23:36,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:36,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:23:36,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:23:36,799 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 11 states. [2019-12-07 18:23:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:37,169 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-12-07 18:23:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:23:37,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-07 18:23:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:37,170 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:23:37,170 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 18:23:37,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:23:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 18:23:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-07 18:23:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:23:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2019-12-07 18:23:37,173 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2019-12-07 18:23:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,173 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2019-12-07 18:23:37,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:23:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2019-12-07 18:23:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:37,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,174 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-12-07 18:23:37,175 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-12-07 18:23:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479221, now seen corresponding path program 1 times [2019-12-07 18:23:37,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026946553] [2019-12-07 18:23:37,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:23:37,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026946553] [2019-12-07 18:23:37,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:37,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:37,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614163932] [2019-12-07 18:23:37,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:23:37,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:37,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:23:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:23:37,290 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 11 states. [2019-12-07 18:23:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:37,766 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-12-07 18:23:37,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:23:37,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-07 18:23:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:37,767 INFO L225 Difference]: With dead ends: 123 [2019-12-07 18:23:37,767 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 18:23:37,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:23:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 18:23:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-12-07 18:23:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 18:23:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-12-07 18:23:37,770 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2019-12-07 18:23:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,771 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-12-07 18:23:37,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:23:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-12-07 18:23:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:23:37,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,771 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-12-07 18:23:37,772 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-12-07 18:23:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1282426124, now seen corresponding path program 1 times [2019-12-07 18:23:37,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473429268] [2019-12-07 18:23:37,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473429268] [2019-12-07 18:23:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860707817] [2019-12-07 18:23:38,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 18:23:38,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:38,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,367 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 16 treesize of output 34 [2019-12-07 18:23:38,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,374 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2019-12-07 18:23:38,407 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-12-07 18:23:38,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,415 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-12-07 18:23:38,454 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-12-07 18:23:38,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,464 INFO L534 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-12-07 18:23:38,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-12-07 18:23:38,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,586 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 60 [2019-12-07 18:23:38,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,612 INFO L614 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-12-07 18:23:38,613 INFO L534 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-12-07 18:23:38,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2019-12-07 18:23:38,686 INFO L343 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2019-12-07 18:23:38,686 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 2 case distinctions, treesize of input 48 treesize of output 60 [2019-12-07 18:23:38,687 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,710 INFO L614 ElimStorePlain]: treesize reduction 32, result has 64.4 percent of original size [2019-12-07 18:23:38,711 INFO L534 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-12-07 18:23:38,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:67 [2019-12-07 18:23:39,146 INFO L343 Elim1Store]: treesize reduction 11, result has 52.2 percent of original size [2019-12-07 18:23:39,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 42 [2019-12-07 18:23:39,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:39,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:39,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:39,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:7 [2019-12-07 18:23:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:39,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:39,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2019-12-07 18:23:39,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475109614] [2019-12-07 18:23:39,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 18:23:39,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 18:23:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:23:39,168 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 39 states. [2019-12-07 18:23:39,774 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-12-07 18:23:40,070 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-07 18:23:40,542 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 18:23:40,836 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-07 18:23:41,160 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-12-07 18:23:41,737 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-12-07 18:23:42,173 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 18:23:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:43,297 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-12-07 18:23:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:23:43,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-12-07 18:23:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:43,298 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:23:43,298 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:23:43,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=411, Invalid=3129, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 18:23:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:23:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2019-12-07 18:23:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 18:23:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2019-12-07 18:23:43,303 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 38 [2019-12-07 18:23:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:43,303 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2019-12-07 18:23:43,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 18:23:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2019-12-07 18:23:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:23:43,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:43,304 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-12-07 18:23:43,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:43,506 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-12-07 18:23:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1282424908, now seen corresponding path program 1 times [2019-12-07 18:23:43,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:43,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611325454] [2019-12-07 18:23:43,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:23:43,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611325454] [2019-12-07 18:23:43,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:43,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:23:43,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316014100] [2019-12-07 18:23:43,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:23:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:23:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:23:43,746 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 16 states. [2019-12-07 18:23:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:44,216 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-12-07 18:23:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:23:44,216 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-12-07 18:23:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:44,217 INFO L225 Difference]: With dead ends: 114 [2019-12-07 18:23:44,217 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 18:23:44,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:23:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 18:23:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-07 18:23:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 18:23:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-12-07 18:23:44,220 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 38 [2019-12-07 18:23:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:44,220 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-12-07 18:23:44,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:23:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-12-07 18:23:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:23:44,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:44,221 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-12-07 18:23:44,221 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-12-07 18:23:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1282463890, now seen corresponding path program 1 times [2019-12-07 18:23:44,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:44,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96375578] [2019-12-07 18:23:44,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:23:44,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96375578] [2019-12-07 18:23:44,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:44,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:44,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750104522] [2019-12-07 18:23:44,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:23:44,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:23:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:23:44,317 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 11 states. [2019-12-07 18:23:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:44,644 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-12-07 18:23:44,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:23:44,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-07 18:23:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:44,645 INFO L225 Difference]: With dead ends: 109 [2019-12-07 18:23:44,645 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:23:44,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:23:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:23:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-12-07 18:23:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:23:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 18:23:44,647 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 38 [2019-12-07 18:23:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:44,647 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 18:23:44,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:23:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 18:23:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:23:44,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:44,648 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-12-07 18:23:44,648 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-12-07 18:23:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1100504094, now seen corresponding path program 1 times [2019-12-07 18:23:44,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:44,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657218526] [2019-12-07 18:23:44,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:44,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657218526] [2019-12-07 18:23:44,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95848592] [2019-12-07 18:23:44,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:45,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 18:23:45,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:45,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,044 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 16 treesize of output 34 [2019-12-07 18:23:45,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-12-07 18:23:45,076 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-12-07 18:23:45,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 18:23:45,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,122 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-12-07 18:23:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:45,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,130 INFO L534 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-12-07 18:23:45,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-12-07 18:23:45,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:45,224 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 42 treesize of output 83 [2019-12-07 18:23:45,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,242 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size [2019-12-07 18:23:45,242 INFO L534 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-12-07 18:23:45,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2019-12-07 18:23:45,319 INFO L343 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2019-12-07 18:23:45,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 99 [2019-12-07 18:23:45,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,341 INFO L614 ElimStorePlain]: treesize reduction 68, result has 42.9 percent of original size [2019-12-07 18:23:45,341 INFO L534 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-12-07 18:23:45,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2019-12-07 18:23:45,707 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 18:23:45,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 99 [2019-12-07 18:23:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:45,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 18:23:45,731 INFO L614 ElimStorePlain]: treesize reduction 92, result has 20.0 percent of original size [2019-12-07 18:23:45,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:45,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:5 [2019-12-07 18:23:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:45,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:45,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2019-12-07 18:23:45,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302401950] [2019-12-07 18:23:45,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:23:45,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:23:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:23:45,740 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 32 states. [2019-12-07 18:23:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:47,728 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-12-07 18:23:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:23:47,729 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-12-07 18:23:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:47,730 INFO L225 Difference]: With dead ends: 109 [2019-12-07 18:23:47,730 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:23:47,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=263, Invalid=2187, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:23:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:23:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-12-07 18:23:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 18:23:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-12-07 18:23:47,733 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 39 [2019-12-07 18:23:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:47,733 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-12-07 18:23:47,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:23:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-12-07 18:23:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:23:47,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:47,734 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-12-07 18:23:47,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:47,936 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-12-07 18:23:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1100466360, now seen corresponding path program 1 times [2019-12-07 18:23:47,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:47,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768301920] [2019-12-07 18:23:47,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:23:48,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768301920] [2019-12-07 18:23:48,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:48,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:23:48,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977925504] [2019-12-07 18:23:48,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:23:48,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:23:48,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:23:48,148 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 16 states. [2019-12-07 18:23:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:48,697 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-12-07 18:23:48,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:23:48,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-12-07 18:23:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:48,698 INFO L225 Difference]: With dead ends: 100 [2019-12-07 18:23:48,698 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:23:48,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:23:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:23:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 18:23:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:23:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-12-07 18:23:48,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 39 [2019-12-07 18:23:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-12-07 18:23:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:23:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-12-07 18:23:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:23:48,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:48,701 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-12-07 18:23:48,701 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-12-07 18:23:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash 244111542, now seen corresponding path program 1 times [2019-12-07 18:23:48,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:48,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48968731] [2019-12-07 18:23:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:48,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48968731] [2019-12-07 18:23:48,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487129624] [2019-12-07 18:23:48,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:49,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 18:23:49,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:49,073 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 18:23:49,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:23:49,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,090 INFO L614 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-12-07 18:23:49,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:24 [2019-12-07 18:23:49,116 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-12-07 18:23:49,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:49,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-07 18:23:49,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:49,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, 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-12-07 18:23:49,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:49,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:49,173 INFO L534 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-12-07 18:23:49,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-12-07 18:23:49,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:49,265 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 42 treesize of output 83 [2019-12-07 18:23:49,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,287 INFO L614 ElimStorePlain]: treesize reduction 42, result has 55.3 percent of original size [2019-12-07 18:23:49,288 INFO L534 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-12-07 18:23:49,288 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2019-12-07 18:23:49,367 INFO L343 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2019-12-07 18:23:49,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 99 [2019-12-07 18:23:49,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:49,392 INFO L614 ElimStorePlain]: treesize reduction 68, result has 47.3 percent of original size [2019-12-07 18:23:49,393 INFO L534 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-12-07 18:23:49,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:70 [2019-12-07 18:23:49,739 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 18:23:49,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 104 [2019-12-07 18:23:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:49,741 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:49,754 INFO L614 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-12-07 18:23:49,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:49,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:24 [2019-12-07 18:23:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:49,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:49,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2019-12-07 18:23:49,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953635798] [2019-12-07 18:23:49,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:23:49,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:23:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:23:49,845 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 33 states. [2019-12-07 18:23:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:51,547 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-12-07 18:23:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:23:51,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-12-07 18:23:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:51,549 INFO L225 Difference]: With dead ends: 103 [2019-12-07 18:23:51,549 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 18:23:51,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=2177, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:23:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 18:23:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-12-07 18:23:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:23:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-12-07 18:23:51,554 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-12-07 18:23:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:51,554 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-12-07 18:23:51,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:23:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-12-07 18:23:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:23:51,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:51,555 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-12-07 18:23:51,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:51,757 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-12-07 18:23:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash 245281334, now seen corresponding path program 1 times [2019-12-07 18:23:51,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:51,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345155670] [2019-12-07 18:23:51,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:23:51,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345155670] [2019-12-07 18:23:51,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:23:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771678194] [2019-12-07 18:23:51,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:23:51,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:23:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:23:51,939 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 16 states. [2019-12-07 18:23:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:52,881 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-12-07 18:23:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:23:52,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-12-07 18:23:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:52,882 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:23:52,882 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:23:52,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:23:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:23:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-07 18:23:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:23:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-12-07 18:23:52,884 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 40 [2019-12-07 18:23:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:52,884 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-12-07 18:23:52,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:23:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-12-07 18:23:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:23:52,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:52,885 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-12-07 18:23:52,885 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-12-07 18:23:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2033890821, now seen corresponding path program 1 times [2019-12-07 18:23:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:52,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067845009] [2019-12-07 18:23:52,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:53,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067845009] [2019-12-07 18:23:53,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624033748] [2019-12-07 18:23:53,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:53,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:23:53,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:53,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,214 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-12-07 18:23:53,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:53,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:53,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:23:53,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:23:53,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:53,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:53,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-12-07 18:23:53,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,379 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 27 treesize of output 23 [2019-12-07 18:23:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,380 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:53,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:53,386 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2019-12-07 18:23:53,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:53,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:53,512 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 16 treesize of output 32 [2019-12-07 18:23:53,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:53,523 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 18:23:53,523 INFO L534 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-12-07 18:23:53,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 18:23:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:53,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:53,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2019-12-07 18:23:53,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118618589] [2019-12-07 18:23:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:23:53,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:23:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:23:53,552 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 30 states. [2019-12-07 18:23:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:55,490 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 18:23:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:23:55,492 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-12-07 18:23:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:55,494 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:23:55,495 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:23:55,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:23:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:23:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 18:23:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:23:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-12-07 18:23:55,506 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2019-12-07 18:23:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:55,507 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-12-07 18:23:55,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:23:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-12-07 18:23:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:23:55,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:55,510 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-12-07 18:23:55,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:55,712 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-12-07 18:23:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2033459845, now seen corresponding path program 1 times [2019-12-07 18:23:55,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:55,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185435075] [2019-12-07 18:23:55,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:56,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185435075] [2019-12-07 18:23:56,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099308358] [2019-12-07 18:23:56,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:56,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:23:56,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:56,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,078 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 16 treesize of output 34 [2019-12-07 18:23:56,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-12-07 18:23:56,103 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-12-07 18:23:56,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,109 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:23:56,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:56,127 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 21 treesize of output 20 [2019-12-07 18:23:56,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:56,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-12-07 18:23:56,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,217 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 42 treesize of output 83 [2019-12-07 18:23:56,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,237 INFO L614 ElimStorePlain]: treesize reduction 42, result has 51.7 percent of original size [2019-12-07 18:23:56,238 INFO L534 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-12-07 18:23:56,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-12-07 18:23:56,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:56,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,296 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 51 treesize of output 113 [2019-12-07 18:23:56,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:56,319 INFO L614 ElimStorePlain]: treesize reduction 68, result has 44.3 percent of original size [2019-12-07 18:23:56,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:56,320 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:57 [2019-12-07 18:23:56,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:56,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:56,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 143 [2019-12-07 18:23:56,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:56,702 INFO L534 ElimStorePlain]: Start of recursive call 2: 37 dim-0 vars, End of recursive call: 37 dim-0 vars, and 2 xjuncts. [2019-12-07 18:23:57,571 WARN L192 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 321 [2019-12-07 18:23:57,572 INFO L614 ElimStorePlain]: treesize reduction 127, result has 86.9 percent of original size [2019-12-07 18:23:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:23:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:23:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:23:57,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:57,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:57,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:57,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:57,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 37 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:57,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:610 [2019-12-07 18:23:57,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:57,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:57,967 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 16 treesize of output 32 [2019-12-07 18:23:57,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:57,975 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 18:23:57,975 INFO L534 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-12-07 18:23:57,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 18:23:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:58,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:58,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2019-12-07 18:23:58,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77106587] [2019-12-07 18:23:58,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 18:23:58,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 18:23:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:23:58,021 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 34 states. [2019-12-07 18:23:59,948 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 18:24:00,522 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-12-07 18:24:00,917 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-12-07 18:24:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:01,641 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-12-07 18:24:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:24:01,641 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-12-07 18:24:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:01,642 INFO L225 Difference]: With dead ends: 100 [2019-12-07 18:24:01,642 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:24:01,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=271, Invalid=2591, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:24:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:24:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-12-07 18:24:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:24:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-12-07 18:24:01,645 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2019-12-07 18:24:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:01,645 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-12-07 18:24:01,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 18:24:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-12-07 18:24:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:24:01,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:01,646 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-12-07 18:24:01,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:01,847 INFO L410 AbstractCegarLoop]: === Iteration 22 === [_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-12-07 18:24:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:01,848 INFO L82 PathProgramCache]: Analyzing trace with hash -694753286, now seen corresponding path program 1 times [2019-12-07 18:24:01,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:01,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140742253] [2019-12-07 18:24:01,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:02,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140742253] [2019-12-07 18:24:02,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583542883] [2019-12-07 18:24:02,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:02,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 18:24:02,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:02,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,364 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-12-07 18:24:02,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:24:02,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,394 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 16 treesize of output 26 [2019-12-07 18:24:02,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-12-07 18:24:02,429 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-12-07 18:24:02,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 18:24:02,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,477 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-12-07 18:24:02,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:02,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:02,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:24:02,496 INFO L614 ElimStorePlain]: treesize reduction 38, result has 49.3 percent of original size [2019-12-07 18:24:02,497 INFO L534 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-12-07 18:24:02,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-12-07 18:24:02,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,596 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-12-07 18:24:02,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,621 INFO L614 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-12-07 18:24:02,622 INFO L534 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-12-07 18:24:02,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2019-12-07 18:24:02,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:02,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:02,718 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-12-07 18:24:02,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:02,755 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-07 18:24:02,756 INFO L534 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-12-07 18:24:02,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:73 [2019-12-07 18:24:03,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:03,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:03,328 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 86 treesize of output 106 [2019-12-07 18:24:03,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:03,344 INFO L614 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-12-07 18:24:03,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:03,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:92, output treesize:10 [2019-12-07 18:24:03,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:03,361 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 16 treesize of output 32 [2019-12-07 18:24:03,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:03,371 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 18:24:03,372 INFO L534 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-12-07 18:24:03,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 18:24:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:03,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:24:03,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 39 [2019-12-07 18:24:03,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96862912] [2019-12-07 18:24:03,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:24:03,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:24:03,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1466, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:24:03,420 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2019-12-07 18:24:04,759 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-12-07 18:24:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:07,065 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 18:24:07,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:24:07,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-12-07 18:24:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:07,067 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:24:07,067 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:24:07,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=340, Invalid=3442, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 18:24:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:24:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-12-07 18:24:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 18:24:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2019-12-07 18:24:07,071 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 44 [2019-12-07 18:24:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:07,071 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2019-12-07 18:24:07,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:24:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2019-12-07 18:24:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:24:07,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:07,072 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-12-07 18:24:07,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:07,273 INFO L410 AbstractCegarLoop]: === Iteration 23 === [_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-12-07 18:24:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash -695184262, now seen corresponding path program 1 times [2019-12-07 18:24:07,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:07,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019657334] [2019-12-07 18:24:07,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:07,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019657334] [2019-12-07 18:24:07,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143909541] [2019-12-07 18:24:07,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 18:24:07,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:07,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,665 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 16 treesize of output 34 [2019-12-07 18:24:07,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,668 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-12-07 18:24:07,688 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-12-07 18:24:07,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:24:07,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:07,712 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 21 treesize of output 20 [2019-12-07 18:24:07,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:24:07,719 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2019-12-07 18:24:07,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,793 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 33 treesize of output 78 [2019-12-07 18:24:07,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,811 INFO L614 ElimStorePlain]: treesize reduction 42, result has 46.2 percent of original size [2019-12-07 18:24:07,811 INFO L534 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-12-07 18:24:07,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2019-12-07 18:24:07,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:07,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:07,866 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 42 treesize of output 108 [2019-12-07 18:24:07,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:07,887 INFO L614 ElimStorePlain]: treesize reduction 68, result has 39.8 percent of original size [2019-12-07 18:24:07,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:24:07,887 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:48 [2019-12-07 18:24:08,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:08,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:08,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 138 [2019-12-07 18:24:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:08,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:24:08,337 INFO L614 ElimStorePlain]: treesize reduction 247, result has 10.2 percent of original size [2019-12-07 18:24:08,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:08,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:18 [2019-12-07 18:24:08,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:08,420 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-12-07 18:24:08,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:08,423 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-12-07 18:24:08,424 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:08,446 INFO L614 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-12-07 18:24:08,447 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 18:24:08,447 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2019-12-07 18:24:08,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:08,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:24:08,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2019-12-07 18:24:08,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318914011] [2019-12-07 18:24:08,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 18:24:08,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 18:24:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:24:08,532 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 37 states. [2019-12-07 18:24:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:12,152 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-12-07 18:24:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:24:12,153 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-12-07 18:24:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:12,154 INFO L225 Difference]: With dead ends: 96 [2019-12-07 18:24:12,154 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 18:24:12,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=322, Invalid=3100, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:24:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 18:24:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-12-07 18:24:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 18:24:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2019-12-07 18:24:12,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2019-12-07 18:24:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:12,160 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2019-12-07 18:24:12,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 18:24:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2019-12-07 18:24:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:24:12,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:12,161 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-12-07 18:24:12,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:12,362 INFO L410 AbstractCegarLoop]: === Iteration 24 === [_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-12-07 18:24:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1597102842, now seen corresponding path program 1 times [2019-12-07 18:24:12,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:12,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034641848] [2019-12-07 18:24:12,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:12,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034641848] [2019-12-07 18:24:12,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009748585] [2019-12-07 18:24:12,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:24:12,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:12,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,671 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-12-07 18:24:12,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:24:12,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:24:12,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 18:24:12,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,794 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 18 treesize of output 18 [2019-12-07 18:24:12,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:12,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:24:12,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 18:24:12,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:12,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:12,883 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-12-07 18:24:12,883 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,886 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-12-07 18:24:12,886 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:12,910 INFO L614 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-12-07 18:24:12,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 18:24:12,910 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2019-12-07 18:24:12,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:12,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:24:12,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2019-12-07 18:24:12,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113226990] [2019-12-07 18:24:12,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:24:12,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:24:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:24:12,971 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 30 states. [2019-12-07 18:24:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:13,942 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-12-07 18:24:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:24:13,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-12-07 18:24:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:13,944 INFO L225 Difference]: With dead ends: 90 [2019-12-07 18:24:13,944 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 18:24:13,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:24:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 18:24:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 18:24:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:24:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-12-07 18:24:13,949 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 44 [2019-12-07 18:24:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-12-07 18:24:13,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:24:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-12-07 18:24:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:24:13,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:13,950 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, 1, 1] [2019-12-07 18:24:14,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:14,152 INFO L410 AbstractCegarLoop]: === Iteration 25 === [_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-12-07 18:24:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1757091995, now seen corresponding path program 1 times [2019-12-07 18:24:14,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:14,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911284521] [2019-12-07 18:24:14,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:14,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911284521] [2019-12-07 18:24:14,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743311416] [2019-12-07 18:24:14,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:14,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 18:24:14,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:14,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,759 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-12-07 18:24:14,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:24:14,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,781 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 16 treesize of output 26 [2019-12-07 18:24:14,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-12-07 18:24:14,818 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-12-07 18:24:14,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 18:24:14,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:14,849 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 29 treesize of output 24 [2019-12-07 18:24:14,849 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:14,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:14,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:24:14,858 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:46 [2019-12-07 18:24:15,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:15,209 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 50 treesize of output 87 [2019-12-07 18:24:15,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:15,252 INFO L614 ElimStorePlain]: treesize reduction 42, result has 55.8 percent of original size [2019-12-07 18:24:15,252 INFO L534 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-12-07 18:24:15,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2019-12-07 18:24:15,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:15,328 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 57 treesize of output 111 [2019-12-07 18:24:15,328 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:15,350 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-12-07 18:24:15,351 INFO L534 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-12-07 18:24:15,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-12-07 18:24:15,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:15,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:16,115 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 18:24:16,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:16,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 184 [2019-12-07 18:24:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:16,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:16,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:16,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:24:16,233 INFO L534 ElimStorePlain]: Start of recursive call 2: 666 dim-0 vars, End of recursive call: 666 dim-0 vars, and 4 xjuncts. [2019-12-07 18:25:27,558 WARN L192 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 5460 DAG size of output: 3734 [2019-12-07 18:25:27,563 INFO L614 ElimStorePlain]: treesize reduction 7825, result has 50.7 percent of original size [2019-12-07 18:25:27,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:25:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-07 18:25:27,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:25:27,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:25:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 18:25:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:25:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 18:25:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:27,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 18:25:27,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:27,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 480 dim-0 vars, and 1 xjuncts. [2019-12-07 18:25:27,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:6503 [2019-12-07 18:25:31,709 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 3998 DAG size of output: 45 [2019-12-07 18:25:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:31,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-07 18:25:31,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:31,890 INFO L614 ElimStorePlain]: treesize reduction 4, result has 82.6 percent of original size [2019-12-07 18:25:31,890 INFO L534 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-12-07 18:25:31,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2019-12-07 18:25:31,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:31,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 30 [2019-12-07 18:25:31,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:31,958 INFO L614 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-12-07 18:25:31,958 INFO L534 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-12-07 18:25:31,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-12-07 18:25:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:32,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:32,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2019-12-07 18:25:32,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546753848] [2019-12-07 18:25:32,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 18:25:32,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:32,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 18:25:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1865, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:25:32,020 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 45 states. [2019-12-07 18:25:33,428 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-12-07 18:25:34,522 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 80 [2019-12-07 18:25:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:35,658 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-12-07 18:25:35,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:25:35,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-12-07 18:25:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:35,659 INFO L225 Difference]: With dead ends: 94 [2019-12-07 18:25:35,659 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 18:25:35,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=394, Invalid=4298, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 18:25:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 18:25:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-12-07 18:25:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 18:25:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-12-07 18:25:35,662 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2019-12-07 18:25:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:35,662 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-12-07 18:25:35,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 18:25:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-12-07 18:25:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:25:35,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:35,663 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, 1, 1, 1] [2019-12-07 18:25:35,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:35,864 INFO L410 AbstractCegarLoop]: === Iteration 26 === [_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-12-07 18:25:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 52368473, now seen corresponding path program 1 times [2019-12-07 18:25:35,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:35,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353488904] [2019-12-07 18:25:35,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353488904] [2019-12-07 18:25:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988609146] [2019-12-07 18:25:36,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:36,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 18:25:36,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:36,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,441 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 16 treesize of output 34 [2019-12-07 18:25:36,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-12-07 18:25:36,469 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-12-07 18:25:36,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:25:36,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,514 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 30 treesize of output 52 [2019-12-07 18:25:36,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:36,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:36,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:25:36,532 INFO L614 ElimStorePlain]: treesize reduction 30, result has 51.6 percent of original size [2019-12-07 18:25:36,532 INFO L534 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-12-07 18:25:36,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-12-07 18:25:36,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,626 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 33 treesize of output 78 [2019-12-07 18:25:36,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,645 INFO L614 ElimStorePlain]: treesize reduction 42, result has 48.1 percent of original size [2019-12-07 18:25:36,646 INFO L534 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-12-07 18:25:36,646 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2019-12-07 18:25:36,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:36,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:36,705 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 42 treesize of output 108 [2019-12-07 18:25:36,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:36,728 INFO L614 ElimStorePlain]: treesize reduction 68, result has 41.4 percent of original size [2019-12-07 18:25:36,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:25:36,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:51 [2019-12-07 18:25:37,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:37,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:37,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:37,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:37,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 61 treesize of output 183 [2019-12-07 18:25:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:37,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 18:25:37,484 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 29 [2019-12-07 18:25:37,485 INFO L614 ElimStorePlain]: treesize reduction 6511, result has 0.7 percent of original size [2019-12-07 18:25:37,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:37,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:56 [2019-12-07 18:25:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:37,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:37,634 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-12-07 18:25:37,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:37,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 18:25:37,644 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:37,649 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-12-07 18:25:37,649 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:37,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:37,659 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-12-07 18:25:37,659 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:37,707 INFO L614 ElimStorePlain]: treesize reduction 37, result has 66.1 percent of original size [2019-12-07 18:25:37,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-12-07 18:25:37,708 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2019-12-07 18:25:37,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:37,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:38,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:38,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,554 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-12-07 18:25:38,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:38,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,611 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 3 case distinctions, treesize of input 17 treesize of output 58 [2019-12-07 18:25:38,611 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:38,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,651 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-12-07 18:25:38,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:38,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-12-07 18:25:38,696 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:38,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,759 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 3 case distinctions, treesize of input 17 treesize of output 58 [2019-12-07 18:25:38,760 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:38,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:38,829 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 3 case distinctions, treesize of input 17 treesize of output 58 [2019-12-07 18:25:38,830 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:39,514 WARN L192 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-12-07 18:25:39,515 INFO L614 ElimStorePlain]: treesize reduction 130, result has 49.4 percent of original size [2019-12-07 18:25:39,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-12-07 18:25:39,518 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:121, output treesize:127 [2019-12-07 18:25:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:25:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:39,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:39,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2019-12-07 18:25:39,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176951118] [2019-12-07 18:25:39,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 18:25:39,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 18:25:39,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1686, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:25:39,925 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 43 states. [2019-12-07 18:25:41,006 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 18:25:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:43,329 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 18:25:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:25:43,330 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 47 [2019-12-07 18:25:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:43,331 INFO L225 Difference]: With dead ends: 91 [2019-12-07 18:25:43,331 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 18:25:43,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=379, Invalid=3911, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 18:25:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 18:25:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-12-07 18:25:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 18:25:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-12-07 18:25:43,337 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 47 [2019-12-07 18:25:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:43,337 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-12-07 18:25:43,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 18:25:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-12-07 18:25:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:25:43,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:43,339 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, 1, 1, 1, 1] [2019-12-07 18:25:43,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:43,540 INFO L410 AbstractCegarLoop]: === Iteration 27 === [_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-12-07 18:25:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1824516203, now seen corresponding path program 1 times [2019-12-07 18:25:43,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:43,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179701698] [2019-12-07 18:25:43,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:25:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:25:43,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:25:43,603 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:25:43,615 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 18:25:43,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:25:43 BoogieIcfgContainer [2019-12-07 18:25:43,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:25:43,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:25:43,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:25:43,631 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:25:43,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:33" (3/4) ... [2019-12-07 18:25:43,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:25:43,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:25:43,635 INFO L168 Benchmark]: Toolchain (without parser) took 130616.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 934.4 MB in the beginning and 828.0 MB in the end (delta: 106.4 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:43,635 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:25:43,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:43,636 INFO L168 Benchmark]: Boogie Preprocessor took 41.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:43,636 INFO L168 Benchmark]: RCFGBuilder took 384.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:43,636 INFO L168 Benchmark]: TraceAbstraction took 129887.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 828.0 MB in the end (delta: 188.5 MB). Peak memory consumption was 293.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:43,636 INFO L168 Benchmark]: Witness Printer took 3.05 ms. Allocated memory is still 1.2 GB. Free memory is still 828.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:25:43,637 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129887.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 828.0 MB in the end (delta: 188.5 MB). Peak memory consumption was 293.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.05 ms. Allocated memory is still 1.2 GB. Free memory is still 828.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}] [L568] last->next = last VAL [\old(len)=3, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}] [L569] last->prev = last VAL [\old(len)=3, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}] [L570] DLL head = last; VAL [\old(len)=3, head={-4:0}, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-4:0}, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-4:0}, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-4:0}, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-4:0}, last={-4:0}, len=3, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={-2:0}, last={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, last={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, last={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-2:0}, last={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-2:0}, last={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={3:0}, last={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={3:0}, last={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L581] last->next = head VAL [\old(len)=3, head={3:0}, last={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L582] head->prev = last VAL [\old(len)=3, head={3:0}, last={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L583] return head; VAL [\old(len)=3, \result={3:0}, head={3:0}, last={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={3:0}, new_head={3:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={3:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={3:0}] [L586] EXPR head->prev VAL [head={3:0}, head={3:0}, head->prev={-4:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={3:0}, head={3:0}, head->next={-2:0}, pred={-4:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={3:0}, head={3:0}, pred={-4:0}, succ={-2:0}] [L607] free(pred) VAL [head={3:0}, head={3:0}, pred={-4:0}, succ={-2:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={3:0}, head={3:0}, pred={-4:0}, succ={-2:0}] [L612] free(head) VAL [head={3:0}, head={3:0}, pred={-4:0}, succ={-2:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={3:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 153 locations, 59 error locations. Result: UNSAFE, OverallTime: 129.8s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2172 SDtfs, 4386 SDslu, 10849 SDs, 0 SdLazy, 22054 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1097 GetRequests, 388 SyntacticMatches, 22 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4888 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 59 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 92.3s InterpolantComputationTime, 1321 NumberOfCodeBlocks, 1321 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1235 ConstructedInterpolants, 155 QuantifiedInterpolants, 629812 SizeOfPredicates, 179 NumberOfNonLiveVariables, 2383 ConjunctsInSsa, 504 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 47/193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 18:25:44,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:25:44,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:25:44,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:25:44,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:25:44,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:25:44,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:25:44,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:25:44,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:25:44,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:25:44,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:25:44,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:25:44,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:25:44,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:25:44,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:25:44,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:25:44,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:25:44,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:25:44,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:25:44,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:25:44,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:25:44,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:25:44,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:25:44,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:25:44,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:25:44,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:25:44,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:25:44,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:25:44,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:25:44,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:25:44,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:25:44,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:25:44,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:25:44,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:25:44,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:25:44,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:25:44,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:25:44,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:25:44,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:25:44,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:25:44,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:25:44,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 18:25:45,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:25:45,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:25:45,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:25:45,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:25:45,004 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:25:45,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:25:45,005 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:25:45,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:25:45,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:25:45,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:25:45,007 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:25:45,008 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:25:45,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:25:45,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:25:45,008 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_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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-12-07 18:25:45,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:25:45,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:25:45,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:25:45,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:25:45,191 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:25:45,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 18:25:45,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/403070979/20c7e5acff2049238fac01c7dc1b0c03/FLAG372f35f40 [2019-12-07 18:25:45,606 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:25:45,606 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 18:25:45,614 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/403070979/20c7e5acff2049238fac01c7dc1b0c03/FLAG372f35f40 [2019-12-07 18:25:46,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/data/403070979/20c7e5acff2049238fac01c7dc1b0c03 [2019-12-07 18:25:46,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:25:46,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:25:46,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:46,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:25:46,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:25:46,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560fc856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46, skipping insertion in model container [2019-12-07 18:25:46,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:25:46,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:25:46,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:46,263 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:25:46,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:46,325 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:25:46,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46 WrapperNode [2019-12-07 18:25:46,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:46,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:25:46,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:25:46,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:25:46,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... [2019-12-07 18:25:46,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:25:46,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:25:46,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:25:46,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:25:46,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/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-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:25:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 18:25:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-12-07 18:25:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-12-07 18:25:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:25:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:25:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:25:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:25:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:25:46,419 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:25:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:25:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:25:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:25:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:25:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:25:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:25:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:25:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:25:46,843 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 18:25:46,860 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:25:46,860 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 18:25:46,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:46 BoogieIcfgContainer [2019-12-07 18:25:46,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:25:46,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:25:46,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:25:46,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:25:46,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:25:46" (1/3) ... [2019-12-07 18:25:46,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8387e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:46, skipping insertion in model container [2019-12-07 18:25:46,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:46" (2/3) ... [2019-12-07 18:25:46,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8387e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:46, skipping insertion in model container [2019-12-07 18:25:46,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:46" (3/3) ... [2019-12-07 18:25:46,866 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-12-07 18:25:46,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:25:46,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-12-07 18:25:46,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-12-07 18:25:46,897 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:25:46,897 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:25:46,897 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:25:46,897 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:25:46,898 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:25:46,898 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:25:46,898 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:25:46,898 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:25:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-12-07 18:25:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:25:46,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:46,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:46,925 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-12-07 18:25:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1881586756, now seen corresponding path program 1 times [2019-12-07 18:25:46,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:46,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993114236] [2019-12-07 18:25:46,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:47,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:25:47,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:47,077 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-12-07 18:25:47,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:47,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:47,083 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:47,084 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:25:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:47,090 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:47,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993114236] [2019-12-07 18:25:47,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:47,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:25:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883107168] [2019-12-07 18:25:47,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:47,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:47,116 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-12-07 18:25:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:47,244 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-12-07 18:25:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:47,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 18:25:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:47,256 INFO L225 Difference]: With dead ends: 143 [2019-12-07 18:25:47,256 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:25:47,258 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-12-07 18:25:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:25:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-12-07 18:25:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 18:25:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-12-07 18:25:47,294 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2019-12-07 18:25:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:47,294 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-12-07 18:25:47,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-12-07 18:25:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:25:47,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:47,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:47,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:25:47,497 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-12-07 18:25:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1881586757, now seen corresponding path program 1 times [2019-12-07 18:25:47,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:47,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866056899] [2019-12-07 18:25:47,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:47,647 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:47,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:47,655 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-12-07 18:25:47,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:47,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:47,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:47,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:25:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:47,669 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:47,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866056899] [2019-12-07 18:25:47,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:47,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 18:25:47,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451597813] [2019-12-07 18:25:47,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:47,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:47,706 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 4 states. [2019-12-07 18:25:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:47,784 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-12-07 18:25:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:47,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:25:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:47,786 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:25:47,786 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:25:47,787 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-12-07 18:25:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:25:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-12-07 18:25:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:25:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-12-07 18:25:47,795 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2019-12-07 18:25:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:47,796 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-12-07 18:25:47,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-12-07 18:25:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:25:47,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:47,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:47,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:25:47,998 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-12-07 18:25:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 30803427, now seen corresponding path program 1 times [2019-12-07 18:25:48,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:48,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083978240] [2019-12-07 18:25:48,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:48,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:25:48,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:48,180 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:48,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083978240] [2019-12-07 18:25:48,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:48,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 18:25:48,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55898708] [2019-12-07 18:25:48,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:48,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:48,205 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 8 states. [2019-12-07 18:25:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:48,256 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2019-12-07 18:25:48,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:25:48,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 18:25:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:48,258 INFO L225 Difference]: With dead ends: 143 [2019-12-07 18:25:48,258 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 18:25:48,259 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-12-07 18:25:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 18:25:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-12-07 18:25:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 18:25:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2019-12-07 18:25:48,269 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 15 [2019-12-07 18:25:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:48,270 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2019-12-07 18:25:48,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2019-12-07 18:25:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:25:48,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:48,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:48,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:25:48,473 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-12-07 18:25:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 30804964, now seen corresponding path program 1 times [2019-12-07 18:25:48,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:48,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762705238] [2019-12-07 18:25:48,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:48,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:25:48,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:48,609 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-12-07 18:25:48,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:48,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:48,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:48,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:25:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:48,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:48,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762705238] [2019-12-07 18:25:48,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:48,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:25:48,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173669921] [2019-12-07 18:25:48,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:48,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:48,620 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 3 states. [2019-12-07 18:25:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:48,715 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-12-07 18:25:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:48,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 18:25:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:48,716 INFO L225 Difference]: With dead ends: 138 [2019-12-07 18:25:48,716 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 18:25:48,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-12-07 18:25:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 18:25:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-12-07 18:25:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-07 18:25:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-12-07 18:25:48,723 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 15 [2019-12-07 18:25:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:48,723 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-12-07 18:25:48,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-12-07 18:25:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:25:48,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:48,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:48,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:25:48,926 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-12-07 18:25:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash 30804965, now seen corresponding path program 1 times [2019-12-07 18:25:48,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:48,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221054453] [2019-12-07 18:25:48,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:49,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:49,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:49,050 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-12-07 18:25:49,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:49,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:49,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:49,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:25:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:49,061 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221054453] [2019-12-07 18:25:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 18:25:49,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225880449] [2019-12-07 18:25:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:49,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:49,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:49,104 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 4 states. [2019-12-07 18:25:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:49,189 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2019-12-07 18:25:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:49,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:25:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:49,191 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:25:49,191 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:25:49,192 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-12-07 18:25:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:25:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-12-07 18:25:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 18:25:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2019-12-07 18:25:49,199 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 15 [2019-12-07 18:25:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:49,199 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2019-12-07 18:25:49,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2019-12-07 18:25:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:25:49,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:49,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:49,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:25:49,402 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-12-07 18:25:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash 954954032, now seen corresponding path program 1 times [2019-12-07 18:25:49,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:49,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268813081] [2019-12-07 18:25:49,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:49,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:25:49,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:49,526 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-12-07 18:25:49,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:49,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:49,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:49,529 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:25:49,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:49,551 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-12-07 18:25:49,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:49,563 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:25:49,564 INFO L534 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-12-07 18:25:49,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 18:25:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:49,571 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:49,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268813081] [2019-12-07 18:25:49,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:49,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:25:49,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217833892] [2019-12-07 18:25:49,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:49,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:49,585 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 4 states. [2019-12-07 18:25:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:49,719 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2019-12-07 18:25:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:25:49,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:25:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:49,720 INFO L225 Difference]: With dead ends: 138 [2019-12-07 18:25:49,720 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 18:25:49,720 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-12-07 18:25:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 18:25:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-12-07 18:25:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 18:25:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2019-12-07 18:25:49,724 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 16 [2019-12-07 18:25:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:49,724 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2019-12-07 18:25:49,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2019-12-07 18:25:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:25:49,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:49,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:49,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:25:49,927 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-12-07 18:25:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 954954033, now seen corresponding path program 1 times [2019-12-07 18:25:49,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:49,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110194512] [2019-12-07 18:25:49,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:50,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:25:50,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:50,043 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-12-07 18:25:50,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:50,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:50,052 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-12-07 18:25:50,052 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:50,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:50,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:50,058 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 18:25:50,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:50,085 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-12-07 18:25:50,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:50,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:50,096 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-12-07 18:25:50,096 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:50,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:50,105 INFO L534 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-12-07 18:25:50,105 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-12-07 18:25:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:50,126 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:50,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:50,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110194512] [2019-12-07 18:25:50,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:50,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:25:50,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006851832] [2019-12-07 18:25:50,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:50,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:50,299 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 8 states. [2019-12-07 18:25:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:50,967 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-12-07 18:25:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:25:50,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 18:25:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:50,968 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:25:50,969 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:25:50,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:25:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-12-07 18:25:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 18:25:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2019-12-07 18:25:50,973 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 16 [2019-12-07 18:25:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:50,973 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2019-12-07 18:25:50,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2019-12-07 18:25:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:25:50,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:50,974 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:51,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:25:51,176 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-12-07 18:25:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -804512848, now seen corresponding path program 1 times [2019-12-07 18:25:51,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:51,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653789367] [2019-12-07 18:25:51,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:51,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:25:51,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:51,265 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-12-07 18:25:51,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:25:51,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,286 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-12-07 18:25:51,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,297 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:25:51,297 INFO L534 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-12-07 18:25:51,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 18:25:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:51,302 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:51,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653789367] [2019-12-07 18:25:51,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:51,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-12-07 18:25:51,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790962268] [2019-12-07 18:25:51,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:51,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:51,313 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 4 states. [2019-12-07 18:25:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:51,421 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-12-07 18:25:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:25:51,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:25:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:51,422 INFO L225 Difference]: With dead ends: 135 [2019-12-07 18:25:51,422 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 18:25:51,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-12-07 18:25:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 18:25:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-12-07 18:25:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:25:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-12-07 18:25:51,425 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 21 [2019-12-07 18:25:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:51,425 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-12-07 18:25:51,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-12-07 18:25:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:25:51,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:51,426 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:51,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:25:51,628 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-12-07 18:25:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -804512847, now seen corresponding path program 1 times [2019-12-07 18:25:51,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:51,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901645140] [2019-12-07 18:25:51,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:51,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:25:51,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:51,811 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-12-07 18:25:51,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,820 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-12-07 18:25:51,820 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,825 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 18:25:51,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:51,847 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-12-07 18:25:51,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,865 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-12-07 18:25:51,865 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:51,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:51,873 INFO L534 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-12-07 18:25:51,873 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 18:25:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:51,890 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:51,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:52,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901645140] [2019-12-07 18:25:52,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:52,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-07 18:25:52,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814216090] [2019-12-07 18:25:52,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:52,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:52,070 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 8 states. [2019-12-07 18:25:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:52,660 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-12-07 18:25:52,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:25:52,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 18:25:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:52,662 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:25:52,662 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:25:52,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:25:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-12-07 18:25:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:25:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-12-07 18:25:52,666 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2019-12-07 18:25:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:52,667 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-12-07 18:25:52,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-12-07 18:25:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:25:52,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:52,667 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-12-07 18:25:52,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:25:52,870 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-12-07 18:25:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash -486193078, now seen corresponding path program 1 times [2019-12-07 18:25:52,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:52,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375340972] [2019-12-07 18:25:52,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:53,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:25:53,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:53,008 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-12-07 18:25:53,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:53,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:53,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:53,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:25:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:53,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:53,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375340972] [2019-12-07 18:25:53,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:53,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 18:25:53,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438418821] [2019-12-07 18:25:53,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:25:53,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:25:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:25:53,108 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 9 states. [2019-12-07 18:25:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:53,537 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-12-07 18:25:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:25:53,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-12-07 18:25:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:53,538 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:25:53,538 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 18:25:53,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 18:25:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-07 18:25:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:25:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2019-12-07 18:25:53,541 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2019-12-07 18:25:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:53,541 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2019-12-07 18:25:53,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:25:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2019-12-07 18:25:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:25:53,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:53,542 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-12-07 18:25:53,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:25:53,743 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-12-07 18:25:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:53,743 INFO L82 PathProgramCache]: Analyzing trace with hash -486193077, now seen corresponding path program 1 times [2019-12-07 18:25:53,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:53,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844173591] [2019-12-07 18:25:53,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:53,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:25:53,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:53,836 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-12-07 18:25:53,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:53,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:53,840 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:53,840 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:25:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:53,908 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:54,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844173591] [2019-12-07 18:25:54,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:54,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 18:25:54,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54592996] [2019-12-07 18:25:54,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:25:54,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:25:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:25:54,455 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 16 states. [2019-12-07 18:25:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:55,625 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-12-07 18:25:55,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:25:55,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 18:25:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:55,626 INFO L225 Difference]: With dead ends: 123 [2019-12-07 18:25:55,626 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 18:25:55,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:25:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 18:25:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-12-07 18:25:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 18:25:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-12-07 18:25:55,629 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2019-12-07 18:25:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:55,629 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-12-07 18:25:55,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:25:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-12-07 18:25:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:25:55,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:55,630 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-12-07 18:25:55,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:25:55,832 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-12-07 18:25:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash -813773906, now seen corresponding path program 1 times [2019-12-07 18:25:55,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:55,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591623167] [2019-12-07 18:25:55,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:56,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:25:56,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:56,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:56,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591623167] [2019-12-07 18:25:56,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:56,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2019-12-07 18:25:56,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862111187] [2019-12-07 18:25:56,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:25:56,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:25:56,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:25:56,411 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 18 states. [2019-12-07 18:25:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:57,402 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-12-07 18:25:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:25:57,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-12-07 18:25:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:57,403 INFO L225 Difference]: With dead ends: 118 [2019-12-07 18:25:57,403 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 18:25:57,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:25:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 18:25:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-12-07 18:25:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 18:25:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-12-07 18:25:57,406 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 38 [2019-12-07 18:25:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:57,406 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-12-07 18:25:57,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:25:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-12-07 18:25:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:25:57,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:57,407 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-12-07 18:25:57,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:25:57,608 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-12-07 18:25:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash -813734924, now seen corresponding path program 1 times [2019-12-07 18:25:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:57,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177754348] [2019-12-07 18:25:57,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:57,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:25:57,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:57,734 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-12-07 18:25:57,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:57,738 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:57,738 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:57,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 18:25:57,807 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-12-07 18:25:57,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:57,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:57,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:57,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 18:25:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:57,832 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:25:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:25:58,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177754348] [2019-12-07 18:25:58,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:58,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2019-12-07 18:25:58,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901493031] [2019-12-07 18:25:58,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:25:58,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:25:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:25:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:25:58,085 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 19 states. [2019-12-07 18:25:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,824 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-12-07 18:25:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:25:58,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-12-07 18:25:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,827 INFO L225 Difference]: With dead ends: 113 [2019-12-07 18:25:58,827 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 18:25:58,828 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-12-07 18:25:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 18:25:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-12-07 18:25:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 18:25:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-12-07 18:25:58,834 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 38 [2019-12-07 18:25:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-12-07 18:25:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:25:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-12-07 18:25:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:25:58,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,836 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-12-07 18:25:59,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:25:59,039 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-12-07 18:25:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash -813736140, now seen corresponding path program 1 times [2019-12-07 18:25:59,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:25:59,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118424641] [2019-12-07 18:25:59,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 18:25:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 18:25:59,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:59,184 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-12-07 18:25:59,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:25:59,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,230 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-12-07 18:25:59,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 18:25:59,254 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-12-07 18:25:59,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:25:59,285 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-12-07 18:25:59,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,295 INFO L534 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-12-07 18:25:59,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 18:25:59,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,368 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-12-07 18:25:59,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,396 INFO L614 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2019-12-07 18:25:59,397 INFO L534 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-12-07 18:25:59,397 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 18:25:59,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:59,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,439 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-12-07 18:25:59,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,469 INFO L614 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-12-07 18:25:59,470 INFO L534 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-12-07 18:25:59,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-12-07 18:25:59,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,788 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-12-07 18:25:59,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:59,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:59,794 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 18:25:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,854 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:00,250 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 18:26:00,458 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 18:26:00,607 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 18:26:00,763 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 18:26:01,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:01,382 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 18:26:01,382 INFO L614 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-12-07 18:26:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:01,383 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 18:26:01,384 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:103 [2019-12-07 18:26:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:02,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118424641] [2019-12-07 18:26:02,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:02,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-12-07 18:26:02,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942068954] [2019-12-07 18:26:02,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:26:02,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:26:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:26:02,574 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 32 states. [2019-12-07 18:26:03,890 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-07 18:26:04,369 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-12-07 18:26:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:05,924 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-12-07 18:26:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:26:05,924 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-12-07 18:26:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:05,925 INFO L225 Difference]: With dead ends: 113 [2019-12-07 18:26:05,925 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 18:26:05,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=299, Invalid=1863, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 18:26:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 18:26:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-12-07 18:26:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:26:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 18:26:05,928 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 38 [2019-12-07 18:26:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:05,928 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 18:26:05,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:26:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 18:26:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:26:05,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:05,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] [2019-12-07 18:26:06,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:26:06,130 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-12-07 18:26:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 544021278, now seen corresponding path program 1 times [2019-12-07 18:26:06,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:06,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987056494] [2019-12-07 18:26:06,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:06,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 18:26:06,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:06,305 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-12-07 18:26:06,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:06,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:06,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:06,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-12-07 18:26:06,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 18:26:06,464 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:06,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:06,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:06,468 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-12-07 18:26:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:06,533 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:07,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987056494] [2019-12-07 18:26:07,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:07,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2019-12-07 18:26:07,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216355096] [2019-12-07 18:26:07,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:26:07,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:26:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:26:07,027 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 23 states. [2019-12-07 18:26:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:08,743 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-12-07 18:26:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:26:08,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-12-07 18:26:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:08,745 INFO L225 Difference]: With dead ends: 104 [2019-12-07 18:26:08,745 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 18:26:08,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:26:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 18:26:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 18:26:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 18:26:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-12-07 18:26:08,748 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 39 [2019-12-07 18:26:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:08,748 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-12-07 18:26:08,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:26:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-12-07 18:26:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:26:08,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:08,749 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-12-07 18:26:08,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 18:26:08,950 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-12-07 18:26:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 543983544, now seen corresponding path program 1 times [2019-12-07 18:26:08,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:08,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568908789] [2019-12-07 18:26:08,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:09,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:26:09,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:09,085 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-12-07 18:26:09,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,092 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:26:09,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,140 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-12-07 18:26:09,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 18:26:09,171 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-12-07 18:26:09,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:26:09,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,230 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-12-07 18:26:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:09,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:09,285 INFO L614 ElimStorePlain]: treesize reduction 37, result has 49.3 percent of original size [2019-12-07 18:26:09,285 INFO L534 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-12-07 18:26:09,285 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 18:26:09,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:09,400 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-12-07 18:26:09,400 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:09,460 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.6 percent of original size [2019-12-07 18:26:09,461 INFO L534 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-12-07 18:26:09,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2019-12-07 18:26:11,525 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 18:26:11,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:26:11,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:11,576 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-12-07 18:26:11,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:11,628 INFO L614 ElimStorePlain]: treesize reduction 68, result has 43.3 percent of original size [2019-12-07 18:26:11,629 INFO L534 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-12-07 18:26:11,629 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:55 [2019-12-07 18:26:12,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:12,149 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-12-07 18:26:12,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:12,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:12,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:12,161 INFO L614 ElimStorePlain]: treesize reduction 11, result has 42.1 percent of original size [2019-12-07 18:26:12,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:12,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-12-07 18:26:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:12,259 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:12,681 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:26:12,821 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 18:26:12,981 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:26:13,168 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:26:13,873 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:13,964 INFO L614 ElimStorePlain]: treesize reduction 50, result has 32.4 percent of original size [2019-12-07 18:26:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:13,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:26:13,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:16 [2019-12-07 18:26:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:14,455 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:26:14,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:14,461 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-12-07 18:26:14,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:14,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:14,490 INFO L614 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-12-07 18:26:14,491 INFO L534 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-12-07 18:26:14,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:11 [2019-12-07 18:26:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:14,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568908789] [2019-12-07 18:26:14,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:14,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2019-12-07 18:26:14,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836654403] [2019-12-07 18:26:14,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:26:14,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:26:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:26:14,588 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 33 states. [2019-12-07 18:26:19,972 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 18:26:24,651 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 18:26:25,113 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 18:26:25,399 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 18:26:25,734 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-12-07 18:26:26,091 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-12-07 18:26:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:28,500 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-12-07 18:26:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:26:28,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-12-07 18:26:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:28,502 INFO L225 Difference]: With dead ends: 104 [2019-12-07 18:26:28,502 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 18:26:28,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=286, Invalid=1968, Unknown=2, NotChecked=0, Total=2256 [2019-12-07 18:26:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 18:26:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-12-07 18:26:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:26:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-12-07 18:26:28,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 39 [2019-12-07 18:26:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:28,505 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-12-07 18:26:28,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:26:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-12-07 18:26:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:28,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:28,505 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-12-07 18:26:28,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 18:26:28,707 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-12-07 18:26:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -315209418, now seen corresponding path program 1 times [2019-12-07 18:26:28,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402720948] [2019-12-07 18:26:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:28,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:26:28,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:28,857 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-12-07 18:26:28,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:28,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:28,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:28,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-12-07 18:26:28,941 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-12-07 18:26:28,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:28,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:28,942 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:28,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2019-12-07 18:26:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:28,969 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:29,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402720948] [2019-12-07 18:26:29,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:29,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2019-12-07 18:26:29,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850095278] [2019-12-07 18:26:29,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:26:29,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:26:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:26:29,280 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 20 states. [2019-12-07 18:26:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:30,232 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-12-07 18:26:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:26:30,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-12-07 18:26:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:30,233 INFO L225 Difference]: With dead ends: 99 [2019-12-07 18:26:30,233 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 18:26:30,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:26:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 18:26:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 18:26:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:26:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-12-07 18:26:30,235 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-12-07 18:26:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:30,236 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-12-07 18:26:30,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:26:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-12-07 18:26:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:30,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:30,236 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-12-07 18:26:30,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 18:26:30,438 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-12-07 18:26:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -316379210, now seen corresponding path program 1 times [2019-12-07 18:26:30,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:30,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40046939] [2019-12-07 18:26:30,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:30,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 18:26:30,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:30,726 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-12-07 18:26:30,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:26:30,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,764 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-12-07 18:26:30,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-12-07 18:26:30,784 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-12-07 18:26:30,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:30,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 18:26:30,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,836 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 41 treesize of output 59 [2019-12-07 18:26:30,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:30,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:30,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:30,877 INFO L614 ElimStorePlain]: treesize reduction 41, result has 49.4 percent of original size [2019-12-07 18:26:30,877 INFO L534 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-12-07 18:26:30,877 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-12-07 18:26:30,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:30,974 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-12-07 18:26:30,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:31,018 INFO L614 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-12-07 18:26:31,019 INFO L534 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-12-07 18:26:31,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-12-07 18:26:31,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:26:31,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:31,111 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-12-07 18:26:31,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:31,162 INFO L614 ElimStorePlain]: treesize reduction 68, result has 45.2 percent of original size [2019-12-07 18:26:31,163 INFO L534 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-12-07 18:26:31,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:59 [2019-12-07 18:26:31,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:31,622 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-12-07 18:26:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:31,624 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:31,637 INFO L614 ElimStorePlain]: treesize reduction 42, result has 22.2 percent of original size [2019-12-07 18:26:31,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:31,637 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:7 [2019-12-07 18:26:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:31,711 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:32,140 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 18:26:32,382 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 18:26:32,647 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 18:26:32,934 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 18:26:33,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:33,319 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-12-07 18:26:33,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:33,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:33,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:33,324 INFO L534 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-12-07 18:26:33,325 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:35 [2019-12-07 18:26:33,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:33,470 INFO L614 ElimStorePlain]: treesize reduction 29, result has 29.3 percent of original size [2019-12-07 18:26:33,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:33,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2019-12-07 18:26:33,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:26:33,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:33,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-12-07 18:26:33,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:33,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:33,689 INFO L614 ElimStorePlain]: treesize reduction 5, result has 58.3 percent of original size [2019-12-07 18:26:33,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:33,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:3 [2019-12-07 18:26:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:33,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40046939] [2019-12-07 18:26:33,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:33,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-12-07 18:26:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550671718] [2019-12-07 18:26:33,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:26:33,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:26:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:26:33,697 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 32 states. [2019-12-07 18:26:37,897 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-07 18:26:38,165 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 18:26:38,704 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-12-07 18:26:38,951 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-12-07 18:26:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:40,221 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-12-07 18:26:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:26:40,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-12-07 18:26:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:40,222 INFO L225 Difference]: With dead ends: 102 [2019-12-07 18:26:40,222 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 18:26:40,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=341, Invalid=2109, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:26:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 18:26:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2019-12-07 18:26:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:26:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-12-07 18:26:40,225 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 40 [2019-12-07 18:26:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:40,225 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-12-07 18:26:40,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:26:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-12-07 18:26:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:26:40,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:40,226 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-12-07 18:26:40,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 18:26:40,427 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-12-07 18:26:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1008200613, now seen corresponding path program 1 times [2019-12-07 18:26:40,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:40,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126675159] [2019-12-07 18:26:40,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:40,618 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:26:40,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:40,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:40,642 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-12-07 18:26:40,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,658 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 18:26:40,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,658 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-07 18:26:40,683 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-12-07 18:26:40,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:40,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2019-12-07 18:26:40,827 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-12-07 18:26:40,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:40,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:15 [2019-12-07 18:26:40,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-12-07 18:26:40,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:40,888 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 18:26:40,889 INFO L534 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-12-07 18:26:40,889 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 18:26:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:40,921 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:41,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:41,562 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-12-07 18:26:41,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:41,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:41,563 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:41,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:41,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 18:26:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:41,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126675159] [2019-12-07 18:26:41,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:41,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-12-07 18:26:41,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623270250] [2019-12-07 18:26:41,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:26:41,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:26:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:26:41,569 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 27 states. [2019-12-07 18:26:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:43,190 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 18:26:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:26:43,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2019-12-07 18:26:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:43,191 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:26:43,191 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:26:43,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:26:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:26:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 18:26:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:26:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-12-07 18:26:43,194 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2019-12-07 18:26:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:43,194 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-12-07 18:26:43,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:26:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-12-07 18:26:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:26:43,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:43,194 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-12-07 18:26:43,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 18:26:43,396 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-12-07 18:26:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1008631589, now seen corresponding path program 1 times [2019-12-07 18:26:43,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:43,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143611097] [2019-12-07 18:26:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:43,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:26:43,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:43,548 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-12-07 18:26:43,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:43,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,552 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:26:43,625 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 18:26:43,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 18:26:43,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,659 INFO L614 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-12-07 18:26:43,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,659 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:27 [2019-12-07 18:26:43,681 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-12-07 18:26:43,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:43,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,697 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 18:26:43,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:43,746 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 50 treesize of output 64 [2019-12-07 18:26:43,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:43,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:43,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:43,792 INFO L614 ElimStorePlain]: treesize reduction 41, result has 54.9 percent of original size [2019-12-07 18:26:43,793 INFO L534 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-12-07 18:26:43,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:50 [2019-12-07 18:26:43,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:43,898 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-12-07 18:26:43,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:43,952 INFO L614 ElimStorePlain]: treesize reduction 42, result has 58.4 percent of original size [2019-12-07 18:26:43,953 INFO L534 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-12-07 18:26:43,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2019-12-07 18:26:44,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:26:44,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:44,054 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-12-07 18:26:44,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:44,112 INFO L614 ElimStorePlain]: treesize reduction 46, result has 59.6 percent of original size [2019-12-07 18:26:44,113 INFO L534 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-12-07 18:26:44,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:77 [2019-12-07 18:26:44,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:44,592 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 5 case distinctions, treesize of input 68 treesize of output 102 [2019-12-07 18:26:44,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:44,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:44,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:44,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:44,594 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:26:44,613 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 18:26:44,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:26:44,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:26 [2019-12-07 18:26:44,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 18:26:44,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:44,722 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 18:26:44,722 INFO L534 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-12-07 18:26:44,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-12-07 18:26:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:44,779 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:45,465 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-12-07 18:26:45,635 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 18:26:45,808 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:26:45,974 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:26:46,549 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:26:46,574 INFO L614 ElimStorePlain]: treesize reduction 11, result has 72.5 percent of original size [2019-12-07 18:26:46,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:46,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:24 [2019-12-07 18:26:48,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:48,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:48,721 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 33 treesize of output 37 [2019-12-07 18:26:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:48,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:48,733 INFO L614 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-12-07 18:26:48,733 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:48,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-12-07 18:26:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:48,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143611097] [2019-12-07 18:26:48,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:48,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2019-12-07 18:26:48,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079158410] [2019-12-07 18:26:48,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 18:26:48,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 18:26:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1020, Unknown=1, NotChecked=0, Total=1122 [2019-12-07 18:26:48,741 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 34 states. [2019-12-07 18:26:50,910 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 18:26:51,161 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-07 18:26:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:52,716 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-12-07 18:26:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:26:52,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-12-07 18:26:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:52,717 INFO L225 Difference]: With dead ends: 100 [2019-12-07 18:26:52,717 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:26:52,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=256, Invalid=1999, Unknown=1, NotChecked=0, Total=2256 [2019-12-07 18:26:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:26:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-12-07 18:26:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:26:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-12-07 18:26:52,720 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2019-12-07 18:26:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:52,720 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-12-07 18:26:52,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 18:26:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-12-07 18:26:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:26:52,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:52,721 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-12-07 18:26:52,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 18:26:52,922 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-12-07 18:26:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1781548922, now seen corresponding path program 1 times [2019-12-07 18:26:52,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:52,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967948291] [2019-12-07 18:26:52,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:53,167 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-12-07 18:26:53,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,184 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 18:26:53,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-07 18:26:53,209 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-12-07 18:26:53,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:53,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,219 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2019-12-07 18:26:53,344 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-12-07 18:26:53,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:53,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2019-12-07 18:26:53,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 18:26:53,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,409 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 18:26:53,409 INFO L534 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-12-07 18:26:53,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-12-07 18:26:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:53,441 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:53,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:53,956 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-12-07 18:26:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,956 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:53,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:53,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 18:26:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:53,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967948291] [2019-12-07 18:26:53,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:53,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-12-07 18:26:53,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627067791] [2019-12-07 18:26:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:26:53,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:26:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:26:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:26:53,964 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 26 states. [2019-12-07 18:26:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:55,626 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-12-07 18:26:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:26:55,626 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2019-12-07 18:26:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:55,627 INFO L225 Difference]: With dead ends: 94 [2019-12-07 18:26:55,627 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 18:26:55,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:26:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 18:26:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-07 18:26:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 18:26:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2019-12-07 18:26:55,629 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2019-12-07 18:26:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:55,630 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2019-12-07 18:26:55,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:26:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2019-12-07 18:26:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:26:55,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:55,630 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-12-07 18:26:55,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 18:26:55,831 INFO L410 AbstractCegarLoop]: === Iteration 22 === [_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-12-07 18:26:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -510307206, now seen corresponding path program 1 times [2019-12-07 18:26:55,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:26:55,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863618415] [2019-12-07 18:26:55,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 18:26:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 18:26:56,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:56,005 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-12-07 18:26:56,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:26:56,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,035 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-12-07 18:26:56,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,055 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 18:26:56,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 18:26:56,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 18:26:56,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,159 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-12-07 18:26:56,159 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,159 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:34 [2019-12-07 18:26:56,187 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-12-07 18:26:56,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-12-07 18:26:56,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,259 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 47 treesize of output 61 [2019-12-07 18:26:56,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:26:56,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:56,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:26:56,322 INFO L614 ElimStorePlain]: treesize reduction 49, result has 55.5 percent of original size [2019-12-07 18:26:56,323 INFO L534 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-12-07 18:26:56,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:61 [2019-12-07 18:26:56,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,444 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 52 treesize of output 89 [2019-12-07 18:26:56,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,500 INFO L614 ElimStorePlain]: treesize reduction 46, result has 57.8 percent of original size [2019-12-07 18:26:56,501 INFO L534 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-12-07 18:26:56,501 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2019-12-07 18:26:56,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:26:56,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:56,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 127 [2019-12-07 18:26:56,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:56,672 INFO L614 ElimStorePlain]: treesize reduction 58, result has 55.4 percent of original size [2019-12-07 18:26:56,673 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:26:56,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:81 [2019-12-07 18:26:57,342 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:26:57,342 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 5 case distinctions, treesize of input 79 treesize of output 89 [2019-12-07 18:26:57,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:57,369 INFO L614 ElimStorePlain]: treesize reduction 18, result has 62.5 percent of original size [2019-12-07 18:26:57,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:26:57,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:30 [2019-12-07 18:26:57,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 26 treesize of output 29 [2019-12-07 18:26:57,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:26:57,537 INFO L614 ElimStorePlain]: treesize reduction 8, result has 73.3 percent of original size [2019-12-07 18:26:57,537 INFO L534 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-12-07 18:26:57,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:22 [2019-12-07 18:26:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:57,619 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:26:58,568 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-07 18:26:58,919 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 18:26:59,298 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 18:26:59,650 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 18:27:00,234 INFO L343 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2019-12-07 18:27:00,235 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 3 case distinctions, treesize of input 77 treesize of output 54 [2019-12-07 18:27:00,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:00,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 70 [2019-12-07 18:27:00,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:00,268 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_106, v_arrayElimCell_108], 2=[v_arrayElimCell_107]} [2019-12-07 18:27:00,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863618415] [2019-12-07 18:27:00,271 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b32870e [2019-12-07 18:27:00,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [521158710] [2019-12-07 18:27:00,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 18:27:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:27:00,493 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:00,494 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b32870e [2019-12-07 18:27:00,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098332898] [2019-12-07 18:27:00,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ff08f94-68bb-42d5-946d-fe0b1cfbfbdf/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:27:00,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:00,587 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b32870e [2019-12-07 18:27:00,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:00,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 18:27:00,588 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 18:27:00,588 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:27:01,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:01,209 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 18:27:01,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:27:01 BoogieIcfgContainer [2019-12-07 18:27:01,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:27:01,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:27:01,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:27:01,210 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:27:01,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:46" (3/4) ... [2019-12-07 18:27:01,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:27:01,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:27:01,214 INFO L168 Benchmark]: Toolchain (without parser) took 75209.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 945.7 MB in the beginning and 1.0 GB in the end (delta: -76.2 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:01,214 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:01,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:01,215 INFO L168 Benchmark]: Boogie Preprocessor took 47.86 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:01,215 INFO L168 Benchmark]: RCFGBuilder took 487.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:01,216 INFO L168 Benchmark]: TraceAbstraction took 74347.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:01,216 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:01,217 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.86 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74347.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L617] const int len = 3; [L618] CALL, EXPR dll_circular_create(len) [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) [L568] last->next = last [L569] last->prev = last [L570] DLL head = last; [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND FALSE !(len > 1) [L581] last->next = head [L582] head->prev = last [L583] return head; [L618] RET, EXPR dll_circular_create(len) [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) [L586] EXPR head->prev [L586] DLL pred = head->prev; [L587] EXPR head->next [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND TRUE __VERIFIER_nondet_int() [L598] free(succ) [L598] free(succ) [L598] free(succ) [L599] COND FALSE !(__VERIFIER_nondet_int()) [L603] free(pred) [L603] free(pred) [L603] free(pred) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 159 locations, 59 error locations. Result: UNKNOWN, OverallTime: 74.2s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1998 SDtfs, 2517 SDslu, 10294 SDs, 0 SdLazy, 9900 SolverSat, 305 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 884 SyntacticMatches, 16 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 34.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1168 ConstructedInterpolants, 137 QuantifiedInterpolants, 370292 SizeOfPredicates, 221 NumberOfNonLiveVariables, 2537 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 42 InterpolantComputations, 26 PerfectInterpolantSequences, 96/184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...