./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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 961cc3a58fcae29742bbb59c935dd1303821abd8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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 961cc3a58fcae29742bbb59c935dd1303821abd8 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:19:11,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:19:11,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:19:11,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:19:11,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:19:11,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:19:11,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:19:11,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:19:11,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:19:11,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:19:11,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:19:11,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:19:11,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:19:11,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:19:11,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:19:11,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:19:11,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:19:11,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:19:11,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:19:11,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:19:11,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:19:11,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:19:11,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:19:11,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:19:11,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:19:11,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:19:11,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:19:11,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:19:11,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:19:11,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:19:11,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:19:11,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:19:11,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:19:11,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:19:11,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:19:11,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:19:11,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:19:11,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:19:11,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:19:11,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:19:11,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:19:11,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:19:11,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:19:11,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:19:11,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:19:11,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:19:11,830 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:19:11,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:19:11,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:19:11,831 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:19:11,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:19:11,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:19:11,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:19:11,833 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:19:11,833 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:19:11,834 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:19:11,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:19:11,834 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:19:11,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:19:11,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:19:11,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:19:11,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:19:11,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:19:11,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:19:11,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:19:11,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:19:11,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:19:11,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:19:11,839 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_9c440b39-b52b-4ea3-885a-641060433acb/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 -> 961cc3a58fcae29742bbb59c935dd1303821abd8 [2019-11-15 22:19:11,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:19:11,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:19:11,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:19:11,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:19:11,936 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:19:11,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2019-11-15 22:19:12,003 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/61509fc89/aa08a37527334d18bced4cf261c70931/FLAG2ab877aa0 [2019-11-15 22:19:12,619 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:19:12,620 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2019-11-15 22:19:12,643 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/61509fc89/aa08a37527334d18bced4cf261c70931/FLAG2ab877aa0 [2019-11-15 22:19:12,845 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/61509fc89/aa08a37527334d18bced4cf261c70931 [2019-11-15 22:19:12,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:19:12,850 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:19:12,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:19:12,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:19:12,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:19:12,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:12" (1/1) ... [2019-11-15 22:19:12,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd7d4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:12, skipping insertion in model container [2019-11-15 22:19:12,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:12" (1/1) ... [2019-11-15 22:19:12,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:19:12,912 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:19:13,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:19:13,410 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:19:13,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:19:13,534 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:19:13,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13 WrapperNode [2019-11-15 22:19:13,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:19:13,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:19:13,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:19:13,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:19:13,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... [2019-11-15 22:19:13,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:19:13,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:19:13,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:19:13,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:19:13,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:19:13,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:19:13,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:19:13,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:19:13,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:19:13,697 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:19:13,698 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 22:19:13,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 22:19:13,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-15 22:19:13,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_prepend [2019-11-15 22:19:13,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:19:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:19:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:19:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:19:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:19:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:19:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:19:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:19:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:19:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:19:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:19:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:19:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:19:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:19:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:19:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:19:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:19:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:19:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:19:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:19:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:19:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:19:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:19:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:19:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:19:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:19:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:19:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:19:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:19:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:19:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:19:13,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:19:13,720 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:19:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:19:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:19:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:19:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:19:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:19:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:19:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:19:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:19:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:19:13,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:19:13,723 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:19:13,723 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:19:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:19:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:19:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:19:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:19:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:19:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 22:19:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:19:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_prepend [2019-11-15 22:19:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:19:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:19:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:19:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:19:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:19:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:19:14,354 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:19:14,782 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:19:14,782 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:19:14,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:14 BoogieIcfgContainer [2019-11-15 22:19:14,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:19:14,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:19:14,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:19:14,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:19:14,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:19:12" (1/3) ... [2019-11-15 22:19:14,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f6174b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:14, skipping insertion in model container [2019-11-15 22:19:14,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:13" (2/3) ... [2019-11-15 22:19:14,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f6174b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:14, skipping insertion in model container [2019-11-15 22:19:14,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:14" (3/3) ... [2019-11-15 22:19:14,797 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2019-11-15 22:19:14,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:19:14,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-11-15 22:19:14,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-11-15 22:19:14,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:19:14,870 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:19:14,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:19:14,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:19:14,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:19:14,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:19:14,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:19:14,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:19:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 22:19:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:19:14,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:14,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:14,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash -357346190, now seen corresponding path program 1 times [2019-11-15 22:19:14,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:14,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131450913] [2019-11-15 22:19:14,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:14,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:14,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:15,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-11-15 22:19:15,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131450913] [2019-11-15 22:19:15,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:15,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:19:15,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074619937] [2019-11-15 22:19:15,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:19:15,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:19:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:19:15,232 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-15 22:19:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:15,896 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2019-11-15 22:19:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:19:15,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 22:19:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:15,912 INFO L225 Difference]: With dead ends: 162 [2019-11-15 22:19:15,912 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:19:15,914 INFO L600 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-11-15 22:19:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:19:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 136. [2019-11-15 22:19:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 22:19:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2019-11-15 22:19:15,970 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 12 [2019-11-15 22:19:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:15,971 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2019-11-15 22:19:15,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:19:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2019-11-15 22:19:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:19:15,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:15,972 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:15,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash -357346189, now seen corresponding path program 1 times [2019-11-15 22:19:15,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:15,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368407342] [2019-11-15 22:19:15,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:15,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:15,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:16,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368407342] [2019-11-15 22:19:16,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:16,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:19:16,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876239297] [2019-11-15 22:19:16,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:19:16,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:19:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:19:16,089 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 4 states. [2019-11-15 22:19:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:16,609 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-11-15 22:19:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:19:16,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 22:19:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:16,613 INFO L225 Difference]: With dead ends: 152 [2019-11-15 22:19:16,613 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 22:19:16,614 INFO L600 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-11-15 22:19:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 22:19:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2019-11-15 22:19:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 22:19:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-11-15 22:19:16,647 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 12 [2019-11-15 22:19:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:16,647 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-11-15 22:19:16,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:19:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-11-15 22:19:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:19:16,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:16,650 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:16,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -968318626, now seen corresponding path program 1 times [2019-11-15 22:19:16,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:16,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229360153] [2019-11-15 22:19:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:16,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:16,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229360153] [2019-11-15 22:19:16,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:16,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:19:16,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938463955] [2019-11-15 22:19:16,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:19:16,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:19:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:19:16,872 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 7 states. [2019-11-15 22:19:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:17,593 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2019-11-15 22:19:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:19:17,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 22:19:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:17,596 INFO L225 Difference]: With dead ends: 153 [2019-11-15 22:19:17,597 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 22:19:17,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:19:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 22:19:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2019-11-15 22:19:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 22:19:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2019-11-15 22:19:17,611 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 20 [2019-11-15 22:19:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:17,614 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2019-11-15 22:19:17,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:19:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2019-11-15 22:19:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:19:17,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:17,616 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:17,616 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 82672975, now seen corresponding path program 1 times [2019-11-15 22:19:17,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:17,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76589619] [2019-11-15 22:19:17,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:17,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:17,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:17,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76589619] [2019-11-15 22:19:17,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:17,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:19:17,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102409884] [2019-11-15 22:19:17,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:19:17,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:19:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:17,923 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 9 states. [2019-11-15 22:19:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:18,689 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-15 22:19:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:18,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 22:19:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:18,692 INFO L225 Difference]: With dead ends: 153 [2019-11-15 22:19:18,692 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 22:19:18,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:19:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 22:19:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2019-11-15 22:19:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 22:19:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-11-15 22:19:18,720 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 30 [2019-11-15 22:19:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:18,720 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-11-15 22:19:18,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:19:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-11-15 22:19:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:19:18,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:18,722 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:18,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 82672974, now seen corresponding path program 1 times [2019-11-15 22:19:18,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:18,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95559271] [2019-11-15 22:19:18,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:18,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:18,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:19:18,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95559271] [2019-11-15 22:19:18,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:18,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:19:18,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468962681] [2019-11-15 22:19:18,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:19:18,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:19:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:18,899 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 8 states. [2019-11-15 22:19:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:19,546 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-15 22:19:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:19,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 22:19:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:19,548 INFO L225 Difference]: With dead ends: 152 [2019-11-15 22:19:19,548 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 22:19:19,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:19:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 22:19:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2019-11-15 22:19:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 22:19:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-15 22:19:19,559 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 30 [2019-11-15 22:19:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:19,559 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-15 22:19:19,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:19:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-15 22:19:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:19:19,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:19,564 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:19,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2139316335, now seen corresponding path program 1 times [2019-11-15 22:19:19,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:19,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479210427] [2019-11-15 22:19:19,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:19,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:19,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:19,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479210427] [2019-11-15 22:19:19,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817757605] [2019-11-15 22:19:19,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:19,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:19:19,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:20,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:19:20,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:20,143 INFO L375 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 23 [2019-11-15 22:19:20,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:20,174 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 22:19:20,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:20,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 22:19:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:20,192 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:20,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 22:19:20,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803705176] [2019-11-15 22:19:20,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:19:20,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:19:20,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:19:20,194 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 12 states. [2019-11-15 22:19:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:21,758 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2019-11-15 22:19:21,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:19:21,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-15 22:19:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:21,762 INFO L225 Difference]: With dead ends: 159 [2019-11-15 22:19:21,762 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:19:21,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:19:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:19:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-11-15 22:19:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 22:19:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2019-11-15 22:19:21,781 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 32 [2019-11-15 22:19:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:21,784 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2019-11-15 22:19:21,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:19:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2019-11-15 22:19:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:19:21,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:21,789 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:21,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:21,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2139316336, now seen corresponding path program 1 times [2019-11-15 22:19:21,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:21,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879107346] [2019-11-15 22:19:21,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:21,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:21,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:22,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879107346] [2019-11-15 22:19:22,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497345501] [2019-11-15 22:19:22,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:22,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:19:22,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:22,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:19:22,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:22,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:22,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:22,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:19:22,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:22,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 22:19:22,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:22,854 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 22:19:22,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:22,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 22:19:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:22,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:22,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 22:19:22,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856981563] [2019-11-15 22:19:22,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:19:22,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:19:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:19:22,867 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 16 states. [2019-11-15 22:19:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:24,517 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2019-11-15 22:19:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:19:24,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 22:19:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:24,519 INFO L225 Difference]: With dead ends: 159 [2019-11-15 22:19:24,519 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:19:24,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:19:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:19:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-11-15 22:19:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 22:19:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2019-11-15 22:19:24,526 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 32 [2019-11-15 22:19:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:24,527 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2019-11-15 22:19:24,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:19:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2019-11-15 22:19:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:19:24,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:24,528 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:24,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:24,732 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1406182778, now seen corresponding path program 1 times [2019-11-15 22:19:24,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:24,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604373563] [2019-11-15 22:19:24,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:24,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:24,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:24,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604373563] [2019-11-15 22:19:24,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303239711] [2019-11-15 22:19:24,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:25,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:19:25,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:25,093 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:25,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-15 22:19:25,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475835993] [2019-11-15 22:19:25,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:19:25,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:25,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:19:25,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:25,095 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 8 states. [2019-11-15 22:19:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:25,506 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-15 22:19:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:25,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-15 22:19:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:25,508 INFO L225 Difference]: With dead ends: 157 [2019-11-15 22:19:25,508 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 22:19:25,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:19:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 22:19:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2019-11-15 22:19:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 22:19:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-11-15 22:19:25,514 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 34 [2019-11-15 22:19:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:25,515 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-11-15 22:19:25,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:19:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-11-15 22:19:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:19:25,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:25,516 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:25,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:25,721 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash -646773853, now seen corresponding path program 1 times [2019-11-15 22:19:25,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:25,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956710432] [2019-11-15 22:19:25,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:25,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:25,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:26,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956710432] [2019-11-15 22:19:26,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101793838] [2019-11-15 22:19:26,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:26,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:19:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:26,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:26,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-15 22:19:26,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929309594] [2019-11-15 22:19:26,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:19:26,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:19:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:19:26,230 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 11 states. [2019-11-15 22:19:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:27,135 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2019-11-15 22:19:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:19:27,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-15 22:19:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:27,138 INFO L225 Difference]: With dead ends: 167 [2019-11-15 22:19:27,139 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 22:19:27,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:19:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 22:19:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 140. [2019-11-15 22:19:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:19:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2019-11-15 22:19:27,147 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 35 [2019-11-15 22:19:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:27,148 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2019-11-15 22:19:27,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:19:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2019-11-15 22:19:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:19:27,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:27,150 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:27,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:27,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash -646773854, now seen corresponding path program 1 times [2019-11-15 22:19:27,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:27,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432165152] [2019-11-15 22:19:27,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:27,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:27,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:19:27,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432165152] [2019-11-15 22:19:27,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828653962] [2019-11-15 22:19:27,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:19:27,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:19:27,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:27,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-11-15 22:19:27,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383156576] [2019-11-15 22:19:27,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:19:27,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:27,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:19:27,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:19:27,658 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 7 states. [2019-11-15 22:19:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:28,297 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-15 22:19:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:28,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-15 22:19:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:28,300 INFO L225 Difference]: With dead ends: 160 [2019-11-15 22:19:28,300 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:19:28,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:19:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:19:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2019-11-15 22:19:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:19:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-11-15 22:19:28,308 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 35 [2019-11-15 22:19:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:28,308 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-11-15 22:19:28,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:19:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-11-15 22:19:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:19:28,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:28,312 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:28,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:28,513 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1424847009, now seen corresponding path program 1 times [2019-11-15 22:19:28,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:28,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16128858] [2019-11-15 22:19:28,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:28,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:28,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:19:28,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16128858] [2019-11-15 22:19:28,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:28,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:19:28,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151260463] [2019-11-15 22:19:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:19:28,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:19:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:28,665 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 9 states. [2019-11-15 22:19:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:29,262 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2019-11-15 22:19:29,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:19:29,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-15 22:19:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:29,264 INFO L225 Difference]: With dead ends: 159 [2019-11-15 22:19:29,264 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:19:29,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:19:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:19:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2019-11-15 22:19:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 22:19:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2019-11-15 22:19:29,270 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 36 [2019-11-15 22:19:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:29,270 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2019-11-15 22:19:29,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:19:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2019-11-15 22:19:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:19:29,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:29,271 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:29,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1424847010, now seen corresponding path program 1 times [2019-11-15 22:19:29,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:29,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83322829] [2019-11-15 22:19:29,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:29,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:29,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:19:29,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83322829] [2019-11-15 22:19:29,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:29,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:19:29,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659006412] [2019-11-15 22:19:29,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:19:29,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:19:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:19:29,496 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 10 states. [2019-11-15 22:19:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:30,396 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-15 22:19:30,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:19:30,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-15 22:19:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:30,398 INFO L225 Difference]: With dead ends: 157 [2019-11-15 22:19:30,399 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 22:19:30,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:19:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 22:19:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2019-11-15 22:19:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 22:19:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2019-11-15 22:19:30,405 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 36 [2019-11-15 22:19:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:30,405 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2019-11-15 22:19:30,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:19:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2019-11-15 22:19:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:19:30,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:30,406 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:30,407 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1787067596, now seen corresponding path program 1 times [2019-11-15 22:19:30,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:30,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072654837] [2019-11-15 22:19:30,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:30,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:30,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:19:30,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072654837] [2019-11-15 22:19:30,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:30,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:19:30,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178704436] [2019-11-15 22:19:30,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:19:30,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:19:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:30,534 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 8 states. [2019-11-15 22:19:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:30,933 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-11-15 22:19:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:19:30,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-15 22:19:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:30,935 INFO L225 Difference]: With dead ends: 145 [2019-11-15 22:19:30,935 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 22:19:30,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:19:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 22:19:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2019-11-15 22:19:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 22:19:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2019-11-15 22:19:30,941 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 47 [2019-11-15 22:19:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:30,941 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2019-11-15 22:19:30,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:19:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2019-11-15 22:19:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:19:30,942 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:30,942 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:30,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash 7360023, now seen corresponding path program 1 times [2019-11-15 22:19:30,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:30,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726779138] [2019-11-15 22:19:30,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:30,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:30,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:19:31,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726779138] [2019-11-15 22:19:31,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125325935] [2019-11-15 22:19:31,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:32,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:19:32,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:32,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:19:32,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:32,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:19:32,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 22:19:32,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:32,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 22:19:32,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:32,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:32,400 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:19:32,401 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 22:19:32,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:32,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:32,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-15 22:19:32,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:32,565 INFO L375 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:19:32,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:32,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 22:19:32,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:32,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:32,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:32,603 INFO L375 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 36 [2019-11-15 22:19:32,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:32,629 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 22:19:32,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:32,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-15 22:19:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:19:32,682 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:32,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-15 22:19:32,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244690351] [2019-11-15 22:19:32,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:19:32,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:19:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:19:32,684 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 22 states. [2019-11-15 22:19:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:34,064 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-15 22:19:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:19:34,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-11-15 22:19:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:34,066 INFO L225 Difference]: With dead ends: 139 [2019-11-15 22:19:34,066 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 22:19:34,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:19:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 22:19:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2019-11-15 22:19:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 22:19:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-11-15 22:19:34,072 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 53 [2019-11-15 22:19:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:34,072 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-11-15 22:19:34,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:19:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-11-15 22:19:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:19:34,073 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:34,073 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:34,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:34,278 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 7360024, now seen corresponding path program 1 times [2019-11-15 22:19:34,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:34,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995222007] [2019-11-15 22:19:34,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:34,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:34,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:19:34,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995222007] [2019-11-15 22:19:34,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476884003] [2019-11-15 22:19:34,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:34,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:19:34,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:34,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:19:34,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:35,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:19:35,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 22:19:35,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:35,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 22:19:35,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:35,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:35,142 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:19:35,143 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 22:19:35,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:35,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:35,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-15 22:19:35,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:35,283 INFO L375 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:19:35,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:35,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 22:19:35,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:35,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:35,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:35,326 INFO L375 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 36 [2019-11-15 22:19:35,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:35,354 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 22:19:35,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:35,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-15 22:19:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:19:35,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:35,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 22:19:35,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614855938] [2019-11-15 22:19:35,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:19:35,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:19:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:19:35,406 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 18 states. [2019-11-15 22:19:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:36,494 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-11-15 22:19:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:19:36,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-11-15 22:19:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:36,495 INFO L225 Difference]: With dead ends: 130 [2019-11-15 22:19:36,495 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 22:19:36,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:19:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 22:19:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2019-11-15 22:19:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:19:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-11-15 22:19:36,502 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 53 [2019-11-15 22:19:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-11-15 22:19:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:19:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-11-15 22:19:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:19:36,503 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:36,504 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:36,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:36,708 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:19:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash 219260096, now seen corresponding path program 1 times [2019-11-15 22:19:36,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:36,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833788995] [2019-11-15 22:19:36,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:36,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:36,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:19:37,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833788995] [2019-11-15 22:19:37,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126255607] [2019-11-15 22:19:37,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:19:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:37,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:19:37,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:37,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 22:19:37,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:37,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:37,991 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-15 22:19:37,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:37,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-15 22:19:49,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:49,524 INFO L375 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 44 [2019-11-15 22:19:49,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:49,576 INFO L567 ElimStorePlain]: treesize reduction 26, result has 65.8 percent of original size [2019-11-15 22:19:49,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:49,605 INFO L341 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2019-11-15 22:19:49,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2019-11-15 22:19:49,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:49,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:49,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:49,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:39 [2019-11-15 22:19:51,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:51,732 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 22:19:51,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2019-11-15 22:19:51,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:51,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:51,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:51,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:11 [2019-11-15 22:19:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:19:51,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:19:51,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [19] total 30 [2019-11-15 22:19:51,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193878631] [2019-11-15 22:19:51,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:19:51,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:19:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=840, Unknown=7, NotChecked=0, Total=930 [2019-11-15 22:19:51,764 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 17 states. [2019-11-15 22:20:15,758 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-15 22:20:19,881 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-15 22:20:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:28,844 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-11-15 22:20:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:20:28,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-11-15 22:20:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:28,846 INFO L225 Difference]: With dead ends: 128 [2019-11-15 22:20:28,846 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 22:20:28,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=129, Invalid=1194, Unknown=9, NotChecked=0, Total=1332 [2019-11-15 22:20:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 22:20:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2019-11-15 22:20:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:20:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-15 22:20:28,851 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 56 [2019-11-15 22:20:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-15 22:20:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:20:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-15 22:20:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:20:28,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:28,853 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:29,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:29,058 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:20:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 219260097, now seen corresponding path program 1 times [2019-11-15 22:20:29,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:29,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182723485] [2019-11-15 22:20:29,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:29,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:29,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:30,517 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:20:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:20:30,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182723485] [2019-11-15 22:20:30,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774558059] [2019-11-15 22:20:30,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:20:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:30,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-15 22:20:30,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:30,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:20:30,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:30,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:30,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:30,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:20:31,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 22:20:31,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:31,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:31,370 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-15 22:20:31,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:20:31,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:31,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:31,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:31,386 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-15 22:20:41,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:41,840 INFO L375 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 44 [2019-11-15 22:20:41,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:41,921 INFO L567 ElimStorePlain]: treesize reduction 26, result has 77.8 percent of original size [2019-11-15 22:20:41,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-11-15 22:20:41,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:41,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:41,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:41,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-11-15 22:20:41,973 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:41,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:41,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:41,998 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:69 [2019-11-15 22:20:42,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:42,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:42,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2019-11-15 22:20:42,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:42,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:42,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:42,147 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 22:20:42,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2019-11-15 22:20:42,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:42,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:42,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:42,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:17 [2019-11-15 22:20:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:42,184 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:42,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-11-15 22:20:42,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417037714] [2019-11-15 22:20:42,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 22:20:42,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 22:20:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1303, Unknown=5, NotChecked=0, Total=1406 [2019-11-15 22:20:42,186 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 38 states. [2019-11-15 22:20:42,807 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 22:21:01,840 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 22:21:04,194 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 22:21:08,700 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2019-11-15 22:21:31,354 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-15 22:21:36,044 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 125 DAG size of output: 67 [2019-11-15 22:21:38,881 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2019-11-15 22:21:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:44,810 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-15 22:21:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:21:44,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2019-11-15 22:21:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:44,812 INFO L225 Difference]: With dead ends: 127 [2019-11-15 22:21:44,812 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:21:44,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=231, Invalid=2615, Unknown=16, NotChecked=0, Total=2862 [2019-11-15 22:21:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:21:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2019-11-15 22:21:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:21:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-11-15 22:21:44,818 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 56 [2019-11-15 22:21:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:44,818 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-11-15 22:21:44,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 22:21:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-11-15 22:21:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:21:44,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:44,820 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:45,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:21:45,024 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:21:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash 219249173, now seen corresponding path program 1 times [2019-11-15 22:21:45,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:45,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379757731] [2019-11-15 22:21:45,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:45,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:45,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:21:45,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379757731] [2019-11-15 22:21:45,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:45,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:21:45,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944342590] [2019-11-15 22:21:45,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:21:45,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:21:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:21:45,171 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 8 states. [2019-11-15 22:21:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:45,663 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-11-15 22:21:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:21:45,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-15 22:21:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:45,665 INFO L225 Difference]: With dead ends: 123 [2019-11-15 22:21:45,665 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 22:21:45,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:21:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 22:21:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-11-15 22:21:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:21:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-11-15 22:21:45,669 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 56 [2019-11-15 22:21:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:45,670 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-11-15 22:21:45,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:21:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-11-15 22:21:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:21:45,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:45,672 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:45,672 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:21:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 219249174, now seen corresponding path program 1 times [2019-11-15 22:21:45,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:45,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584480544] [2019-11-15 22:21:45,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:45,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:45,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:21:45,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584480544] [2019-11-15 22:21:45,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:45,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:21:45,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166597954] [2019-11-15 22:21:45,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:21:45,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:21:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:21:45,920 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 9 states. [2019-11-15 22:21:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:46,489 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-15 22:21:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:21:46,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-15 22:21:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:46,490 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:21:46,490 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:21:46,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:21:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:21:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2019-11-15 22:21:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:21:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-15 22:21:46,494 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 56 [2019-11-15 22:21:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:46,494 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-15 22:21:46,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:21:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-15 22:21:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:21:46,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:46,495 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:46,495 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:21:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2018722725, now seen corresponding path program 1 times [2019-11-15 22:21:46,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:46,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845145415] [2019-11-15 22:21:46,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:46,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:21:46,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845145415] [2019-11-15 22:21:46,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:46,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:21:46,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513588673] [2019-11-15 22:21:46,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:21:46,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:21:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:21:46,638 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 8 states. [2019-11-15 22:21:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:47,325 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-11-15 22:21:47,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:21:47,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-15 22:21:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:47,327 INFO L225 Difference]: With dead ends: 120 [2019-11-15 22:21:47,327 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 22:21:47,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:21:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 22:21:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-11-15 22:21:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 22:21:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-15 22:21:47,332 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 62 [2019-11-15 22:21:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:47,333 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-15 22:21:47,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:21:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-15 22:21:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:21:47,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:47,334 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:47,335 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:21:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2018722726, now seen corresponding path program 1 times [2019-11-15 22:21:47,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:47,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518957136] [2019-11-15 22:21:47,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:47,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:47,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:48,980 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:21:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:21:48,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518957136] [2019-11-15 22:21:48,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175171238] [2019-11-15 22:21:48,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:21:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:49,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 22:21:49,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:21:49,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:21:49,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:49,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:49,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:49,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:3 [2019-11-15 22:21:52,059 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (let ((.cse0 (+ node_create_~temp~0.offset 8))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0) .cse0 (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) .cse0)))) |c_#memory_$Pointer$.offset|) (< |c_#StackHeapBarrier| node_create_~temp~0.base))) is different from true [2019-11-15 22:21:52,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:52,105 INFO L341 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2019-11-15 22:21:52,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2019-11-15 22:21:52,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:52,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:52,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:21:52,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:39 [2019-11-15 22:21:52,477 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-15 22:21:52,486 INFO L375 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 15 [2019-11-15 22:21:52,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:52,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:52,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:52,513 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 22:21:52,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 23 [2019-11-15 22:21:52,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:52,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:52,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:52,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:14 [2019-11-15 22:21:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2019-11-15 22:21:52,657 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:21:52,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2019-11-15 22:21:52,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398804757] [2019-11-15 22:21:52,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 22:21:52,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 22:21:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1777, Unknown=1, NotChecked=84, Total=1980 [2019-11-15 22:21:52,660 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 45 states. [2019-11-15 22:21:52,992 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-11-15 22:21:53,402 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-15 22:21:54,137 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-15 22:22:00,452 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 22:22:02,662 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:22:06,237 WARN L191 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-11-15 22:22:07,865 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-11-15 22:22:09,515 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-11-15 22:22:10,941 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-11-15 22:22:12,498 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-11-15 22:22:14,198 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-11-15 22:22:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:15,505 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-15 22:22:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:22:15,506 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2019-11-15 22:22:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:15,507 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:22:15,507 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:22:15,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=308, Invalid=3725, Unknown=3, NotChecked=124, Total=4160 [2019-11-15 22:22:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:22:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2019-11-15 22:22:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:22:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-15 22:22:15,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 62 [2019-11-15 22:22:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:15,515 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-15 22:22:15,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 22:22:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-15 22:22:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:22:15,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:15,517 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:15,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:22:15,722 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:22:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1261437191, now seen corresponding path program 1 times [2019-11-15 22:22:15,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:15,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274183561] [2019-11-15 22:22:15,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:22:16,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274183561] [2019-11-15 22:22:16,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:16,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 22:22:16,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522168406] [2019-11-15 22:22:16,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:22:16,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:22:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:22:16,215 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 17 states. [2019-11-15 22:22:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:17,430 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-15 22:22:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:22:17,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-11-15 22:22:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:17,433 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:22:17,433 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:22:17,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:22:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:22:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2019-11-15 22:22:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:22:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-11-15 22:22:17,437 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 62 [2019-11-15 22:22:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:17,438 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-11-15 22:22:17,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:22:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-11-15 22:22:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:22:17,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:17,439 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:17,439 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:22:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1261437192, now seen corresponding path program 1 times [2019-11-15 22:22:17,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:17,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150641614] [2019-11-15 22:22:17,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:22:18,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150641614] [2019-11-15 22:22:18,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306269132] [2019-11-15 22:22:18,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:22:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:18,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:22:18,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:18,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:22:18,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:18,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:18,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:22:18,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:18,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:18,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:22:18,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-15 22:22:18,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:18,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 22:22:18,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:18,943 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-11-15 22:22:18,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:18,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 22:22:18,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,005 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-15 22:22:19,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-11-15 22:22:19,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:19,112 INFO L341 Elim1Store]: treesize reduction 36, result has 40.0 percent of original size [2019-11-15 22:22:19,113 INFO L375 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 119 treesize of output 104 [2019-11-15 22:22:19,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:19,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:19,121 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:19,205 INFO L567 ElimStorePlain]: treesize reduction 34, result has 82.6 percent of original size [2019-11-15 22:22:19,252 INFO L341 Elim1Store]: treesize reduction 24, result has 64.2 percent of original size [2019-11-15 22:22:19,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 132 [2019-11-15 22:22:19,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,307 INFO L567 ElimStorePlain]: treesize reduction 54, result has 73.1 percent of original size [2019-11-15 22:22:19,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:19,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:147 [2019-11-15 22:22:19,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:19,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:19,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 95 [2019-11-15 22:22:19,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:19,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:19,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:19,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 38 [2019-11-15 22:22:19,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:19,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:22:19,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:163, output treesize:13 [2019-11-15 22:22:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:22:19,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:22:19,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 34 [2019-11-15 22:22:19,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5479059] [2019-11-15 22:22:19,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:22:19,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:22:19,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:22:19,673 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 15 states. [2019-11-15 22:22:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:20,820 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-15 22:22:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:22:20,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-11-15 22:22:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:20,821 INFO L225 Difference]: With dead ends: 116 [2019-11-15 22:22:20,821 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 22:22:20,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:22:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 22:22:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2019-11-15 22:22:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 22:22:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-11-15 22:22:20,826 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 62 [2019-11-15 22:22:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:20,827 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-11-15 22:22:20,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:22:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-11-15 22:22:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:22:20,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:20,828 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:21,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:22:21,032 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:22:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1844104796, now seen corresponding path program 1 times [2019-11-15 22:22:21,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:21,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136398850] [2019-11-15 22:22:21,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:21,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:21,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:22,733 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 22:22:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:22:22,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136398850] [2019-11-15 22:22:22,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381085661] [2019-11-15 22:22:22,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/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-11-15 22:22:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:22,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-15 22:22:22,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:23,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:22:23,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:23,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:23,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:22:23,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 22:22:23,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:23,465 INFO L375 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 23 treesize of output 27 [2019-11-15 22:22:23,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:23,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:23,479 INFO L375 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 7 treesize of output 3 [2019-11-15 22:22:23,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:23,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:23,487 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_8| vanished before elimination [2019-11-15 22:22:23,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:22:23,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:10 [2019-11-15 22:22:27,969 INFO L341 Elim1Store]: treesize reduction 20, result has 85.2 percent of original size [2019-11-15 22:22:27,969 INFO L375 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 34 treesize of output 129 [2019-11-15 22:22:27,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:28,064 INFO L567 ElimStorePlain]: treesize reduction 64, result has 64.6 percent of original size [2019-11-15 22:22:28,065 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-11-15 22:22:28,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-11-15 22:22:28,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:28,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:28,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,203 INFO L341 Elim1Store]: treesize reduction 51, result has 57.1 percent of original size [2019-11-15 22:22:28,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 112 [2019-11-15 22:22:28,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:22:28,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:22:28,206 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:28,281 INFO L567 ElimStorePlain]: treesize reduction 88, result has 50.6 percent of original size [2019-11-15 22:22:28,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:28,282 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:103, output treesize:95 [2019-11-15 22:22:28,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:22:28,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:28,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:28,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:28,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:82 [2019-11-15 22:22:28,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:22:28,810 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 22:22:28,810 INFO L375 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 60 [2019-11-15 22:22:28,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:22:28,846 INFO L567 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2019-11-15 22:22:28,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:22:28,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:87, output treesize:24 [2019-11-15 22:22:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:22:29,028 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:22:29,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 44 [2019-11-15 22:22:29,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038408094] [2019-11-15 22:22:29,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 22:22:29,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:29,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 22:22:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1847, Unknown=2, NotChecked=0, Total=1980 [2019-11-15 22:22:29,030 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 45 states. [2019-11-15 22:22:29,765 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:22:46,520 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-11-15 22:22:48,731 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-11-15 22:22:52,464 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-15 22:22:54,886 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-15 22:22:55,228 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-15 22:22:55,589 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-11-15 22:22:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:58,852 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2019-11-15 22:22:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:22:58,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2019-11-15 22:22:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:58,853 INFO L225 Difference]: With dead ends: 121 [2019-11-15 22:22:58,853 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 22:22:58,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=311, Invalid=3589, Unknown=6, NotChecked=0, Total=3906 [2019-11-15 22:22:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 22:22:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-11-15 22:22:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 22:22:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-15 22:22:58,859 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 63 [2019-11-15 22:22:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:58,860 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-15 22:22:58,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 22:22:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-15 22:22:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:22:58,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:58,861 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:59,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:22:59,066 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:22:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1844104795, now seen corresponding path program 1 times [2019-11-15 22:22:59,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:59,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079167670] [2019-11-15 22:22:59,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:59,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:59,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:01,737 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-11-15 22:23:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:23:01,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079167670] [2019-11-15 22:23:01,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141799686] [2019-11-15 22:23:01,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:01,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 105 conjunts are in the unsatisfiable core [2019-11-15 22:23:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:02,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:23:02,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:02,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:02,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:23:02,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:02,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:02,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:02,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:51 [2019-11-15 22:23:03,481 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_BEFORE_CALL_16|], 1=[|v_#valid_BEFORE_CALL_19|]} [2019-11-15 22:23:03,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-15 22:23:03,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:03,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,522 INFO L375 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 29 treesize of output 33 [2019-11-15 22:23:03,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:03,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-15 22:23:03,544 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:03,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,571 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-11-15 22:23:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:03,572 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:03,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:03,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:03,583 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:13 [2019-11-15 22:23:12,333 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_43|], 3=[|v_old(#valid)_AFTER_CALL_56|]} [2019-11-15 22:23:12,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,341 INFO L375 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 42 treesize of output 44 [2019-11-15 22:23:12,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:12,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:12,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:12,419 INFO L375 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 34 treesize of output 70 [2019-11-15 22:23:12,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:12,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:12,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,570 INFO L341 Elim1Store]: treesize reduction 81, result has 58.9 percent of original size [2019-11-15 22:23:12,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 180 [2019-11-15 22:23:12,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:23:12,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:23:12,573 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:12,683 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 22:23:12,684 INFO L567 ElimStorePlain]: treesize reduction 130, result has 51.5 percent of original size [2019-11-15 22:23:12,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:12,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:12,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 85 [2019-11-15 22:23:12,702 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:12,770 INFO L567 ElimStorePlain]: treesize reduction 40, result has 76.0 percent of original size [2019-11-15 22:23:12,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:12,771 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:168, output treesize:138 [2019-11-15 22:23:13,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:13,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:13,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:13,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:13,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:13,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 113 [2019-11-15 22:23:13,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:13,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:13,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:13,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:13,261 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:13,356 INFO L567 ElimStorePlain]: treesize reduction 36, result has 70.2 percent of original size [2019-11-15 22:23:13,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:13,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:172, output treesize:85 [2019-11-15 22:23:13,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:13,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:13,719 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 22:23:13,719 INFO L375 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 57 [2019-11-15 22:23:13,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:13,768 INFO L567 ElimStorePlain]: treesize reduction 26, result has 57.4 percent of original size [2019-11-15 22:23:13,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:13,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:89, output treesize:24 [2019-11-15 22:23:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:23:14,079 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:14,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 62 [2019-11-15 22:23:14,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840151221] [2019-11-15 22:23:14,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-11-15 22:23:14,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-11-15 22:23:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3734, Unknown=4, NotChecked=0, Total=3906 [2019-11-15 22:23:14,081 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 63 states. [2019-11-15 22:23:31,454 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-11-15 22:23:34,123 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-11-15 22:23:38,617 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2019-11-15 22:23:41,091 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-15 22:23:41,900 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-11-15 22:23:46,627 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2019-11-15 22:23:47,123 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-11-15 22:23:47,672 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-11-15 22:23:48,158 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-11-15 22:23:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:52,018 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-15 22:23:52,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:23:52,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-11-15 22:23:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:52,020 INFO L225 Difference]: With dead ends: 120 [2019-11-15 22:23:52,020 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 22:23:52,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=399, Invalid=7425, Unknown=8, NotChecked=0, Total=7832 [2019-11-15 22:23:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 22:23:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-11-15 22:23:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:23:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-11-15 22:23:52,027 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 63 [2019-11-15 22:23:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:52,028 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-11-15 22:23:52,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-11-15 22:23:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-11-15 22:23:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:23:52,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:52,029 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:52,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:52,233 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:23:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1060364809, now seen corresponding path program 1 times [2019-11-15 22:23:52,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:52,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134012308] [2019-11-15 22:23:52,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:52,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:52,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:23:52,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134012308] [2019-11-15 22:23:52,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786678915] [2019-11-15 22:23:52,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:53,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:23:53,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:53,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:53,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:53,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:53,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:53,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:23:53,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:53,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 22:23:53,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:53,598 INFO L567 ElimStorePlain]: treesize reduction 24, result has 46.7 percent of original size [2019-11-15 22:23:53,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:53,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 22:23:53,735 INFO L341 Elim1Store]: treesize reduction 24, result has 64.2 percent of original size [2019-11-15 22:23:53,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2019-11-15 22:23:53,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:53,740 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:53,791 INFO L567 ElimStorePlain]: treesize reduction 32, result has 59.0 percent of original size [2019-11-15 22:23:53,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:53,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2019-11-15 22:23:54,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:54,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2019-11-15 22:23:54,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-11-15 22:23:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:23:54,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:23:54,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 34 [2019-11-15 22:23:54,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287030346] [2019-11-15 22:23:54,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:23:54,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:23:54,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:23:54,171 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 15 states. [2019-11-15 22:23:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:55,308 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-15 22:23:55,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:23:55,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-11-15 22:23:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:55,310 INFO L225 Difference]: With dead ends: 117 [2019-11-15 22:23:55,310 INFO L226 Difference]: Without dead ends: 117 [2019-11-15 22:23:55,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=1660, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:23:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-15 22:23:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2019-11-15 22:23:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 22:23:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-11-15 22:23:55,315 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 64 [2019-11-15 22:23:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:55,315 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-11-15 22:23:55,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:23:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-11-15 22:23:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:23:55,317 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:55,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:55,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:55,529 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:23:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash -553720554, now seen corresponding path program 1 times [2019-11-15 22:23:55,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:55,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600730907] [2019-11-15 22:23:55,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:55,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:55,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:23:56,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600730907] [2019-11-15 22:23:56,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419826894] [2019-11-15 22:23:56,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:56,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:23:56,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:56,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:56,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:56,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:56,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:56,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-15 22:23:56,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:56,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 22:23:56,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,856 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-15 22:23:56,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:56,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 22:23:56,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,914 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-11-15 22:23:56,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:56,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-11-15 22:23:56,991 INFO L341 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2019-11-15 22:23:56,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 77 [2019-11-15 22:23:56,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:57,071 INFO L341 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2019-11-15 22:23:57,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 109 [2019-11-15 22:23:57,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,114 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.7 percent of original size [2019-11-15 22:23:57,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:88 [2019-11-15 22:23:57,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:57,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:57,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 87 [2019-11-15 22:23:57,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:57,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:57,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:57,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2019-11-15 22:23:57,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:57,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:57,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:7 [2019-11-15 22:23:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:23:57,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:23:57,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 35 [2019-11-15 22:23:57,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371985133] [2019-11-15 22:23:57,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:23:57,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:23:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:23:57,582 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 16 states. [2019-11-15 22:23:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:58,378 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-15 22:23:58,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:23:58,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-11-15 22:23:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:58,380 INFO L225 Difference]: With dead ends: 110 [2019-11-15 22:23:58,380 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 22:23:58,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=152, Invalid=1740, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:23:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 22:23:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2019-11-15 22:23:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:23:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-11-15 22:23:58,384 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 68 [2019-11-15 22:23:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:58,385 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-11-15 22:23:58,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:23:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-11-15 22:23:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 22:23:58,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:58,386 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:58,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:58,590 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:23:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 313606843, now seen corresponding path program 1 times [2019-11-15 22:23:58,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:58,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128394698] [2019-11-15 22:23:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:59,449 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-11-15 22:23:59,778 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-11-15 22:24:00,002 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 22:24:00,314 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-15 22:24:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:24:01,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128394698] [2019-11-15 22:24:01,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:24:01,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-11-15 22:24:01,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691933100] [2019-11-15 22:24:01,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:24:01,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:24:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:24:01,199 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 30 states. [2019-11-15 22:24:02,436 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2019-11-15 22:24:03,069 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-11-15 22:24:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:04,057 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-11-15 22:24:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:24:04,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2019-11-15 22:24:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:04,058 INFO L225 Difference]: With dead ends: 128 [2019-11-15 22:24:04,058 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 22:24:04,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=137, Invalid=1669, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:24:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 22:24:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2019-11-15 22:24:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:24:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-11-15 22:24:04,062 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 69 [2019-11-15 22:24:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:04,063 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-11-15 22:24:04,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:24:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-11-15 22:24:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:24:04,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:04,064 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:04,064 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:24:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2053941902, now seen corresponding path program 1 times [2019-11-15 22:24:04,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:04,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141550505] [2019-11-15 22:24:04,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:04,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:04,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:24:04,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141550505] [2019-11-15 22:24:04,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:24:04,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:24:04,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567524964] [2019-11-15 22:24:04,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:24:04,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:24:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:24:04,212 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 11 states. [2019-11-15 22:24:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:04,792 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-15 22:24:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:24:04,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-15 22:24:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:04,794 INFO L225 Difference]: With dead ends: 127 [2019-11-15 22:24:04,794 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:24:04,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:24:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:24:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2019-11-15 22:24:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:24:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-15 22:24:04,798 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 73 [2019-11-15 22:24:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:04,798 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-15 22:24:04,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:24:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-15 22:24:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:24:04,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:04,799 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:04,799 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:24:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2053941901, now seen corresponding path program 1 times [2019-11-15 22:24:04,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:04,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115096699] [2019-11-15 22:24:04,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:04,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:04,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:24:04,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115096699] [2019-11-15 22:24:04,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:24:04,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:24:04,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823818992] [2019-11-15 22:24:04,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:24:04,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:24:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:24:04,915 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 7 states. [2019-11-15 22:24:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:05,199 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2019-11-15 22:24:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:24:05,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 22:24:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:05,201 INFO L225 Difference]: With dead ends: 136 [2019-11-15 22:24:05,201 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 22:24:05,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:24:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 22:24:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2019-11-15 22:24:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:24:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-15 22:24:05,205 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 73 [2019-11-15 22:24:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:05,206 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-15 22:24:05,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:24:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-15 22:24:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:24:05,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:05,207 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:05,207 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2019-11-15 22:24:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1278815095, now seen corresponding path program 1 times [2019-11-15 22:24:05,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:05,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448548032] [2019-11-15 22:24:05,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:05,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:05,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:07,257 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 22:24:07,507 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-15 22:24:07,905 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-11-15 22:24:08,211 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-11-15 22:24:08,645 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-11-15 22:24:09,068 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-11-15 22:24:09,503 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-15 22:24:09,860 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-15 22:24:10,250 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-11-15 22:24:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:24:11,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448548032] [2019-11-15 22:24:11,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999426400] [2019-11-15 22:24:11,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:11,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 134 conjunts are in the unsatisfiable core [2019-11-15 22:24:11,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:12,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 22:24:12,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,514 INFO L375 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 7 treesize of output 3 [2019-11-15 22:24:12,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:24:12,530 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,539 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:10 [2019-11-15 22:24:12,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:24:12,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-11-15 22:24:15,536 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:15,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,599 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:15,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:15,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:191 [2019-11-15 22:24:44,520 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 22:24:56,996 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 22:24:57,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,110 INFO L375 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 15 treesize of output 19 [2019-11-15 22:24:57,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,648 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 22:24:57,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,970 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-11-15 22:24:57,970 INFO L341 Elim1Store]: treesize reduction 394, result has 38.2 percent of original size [2019-11-15 22:24:57,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 2149 treesize of output 1371 [2019-11-15 22:24:57,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,979 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:58,713 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-15 22:24:58,713 INFO L567 ElimStorePlain]: treesize reduction 164, result has 88.3 percent of original size [2019-11-15 22:24:58,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:58,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:58,876 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-15 22:24:58,876 INFO L341 Elim1Store]: treesize reduction 84, result has 50.0 percent of original size [2019-11-15 22:24:58,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 113 [2019-11-15 22:24:58,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,878 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:59,072 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-11-15 22:24:59,073 INFO L567 ElimStorePlain]: treesize reduction 26, result has 86.9 percent of original size [2019-11-15 22:24:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:59,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:59,075 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:2638, output treesize:317 [2019-11-15 22:24:59,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:59,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:00,250 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-11-15 22:25:00,755 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 22:25:00,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:00,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:00,766 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 245 [2019-11-15 22:25:00,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:00,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:00,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 231 [2019-11-15 22:25:00,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:00,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 285 [2019-11-15 22:25:00,782 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,129 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-15 22:25:01,130 INFO L567 ElimStorePlain]: treesize reduction 29, result has 96.1 percent of original size [2019-11-15 22:25:01,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-15 22:25:01,131 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:786, output treesize:718 [2019-11-15 22:25:01,631 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:25:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:02,214 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:25:02,718 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:25:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:02,728 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 20=[v_prenex_8, v_prenex_10, v_prenex_5, v_prenex_7]} [2019-11-15 22:25:02,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:02,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,780 INFO L375 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 195 [2019-11-15 22:25:02,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:03,066 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 122 [2019-11-15 22:25:03,066 INFO L567 ElimStorePlain]: treesize reduction 34, result has 95.2 percent of original size [2019-11-15 22:25:03,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:03,098 INFO L375 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 7 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 87 [2019-11-15 22:25:03,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:03,367 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-11-15 22:25:03,367 INFO L567 ElimStorePlain]: treesize reduction 40, result has 93.7 percent of original size [2019-11-15 22:25:03,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,386 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:03,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:03,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 256 treesize of output 258 [2019-11-15 22:25:03,448 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:03,670 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-11-15 22:25:03,670 INFO L567 ElimStorePlain]: treesize reduction 53, result has 89.5 percent of original size [2019-11-15 22:25:03,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:03,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2019-11-15 22:25:03,693 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:03,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:03,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:03,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:03,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:03,859 INFO L375 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 10 new quantified variables, introduced 10 case distinctions, treesize of input 304 treesize of output 275 [2019-11-15 22:25:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:03,867 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:04,072 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-11-15 22:25:04,073 INFO L567 ElimStorePlain]: treesize reduction 94, result has 68.4 percent of original size [2019-11-15 22:25:04,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:04,275 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 22:25:04,279 INFO L168 Benchmark]: Toolchain (without parser) took 351429.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 944.8 MB in the beginning and 955.3 MB in the end (delta: -10.5 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:04,279 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:04,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:04,280 INFO L168 Benchmark]: Boogie Preprocessor took 80.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:04,280 INFO L168 Benchmark]: RCFGBuilder took 1167.63 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: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:04,281 INFO L168 Benchmark]: TraceAbstraction took 349492.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 955.3 MB in the end (delta: 68.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:04,286 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1167.63 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: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 349492.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 955.3 MB in the end (delta: 68.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:25:06,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:25:06,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:25:06,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:25:06,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:25:06,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:25:06,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:25:06,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:25:06,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:25:06,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:25:06,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:25:06,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:25:06,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:25:06,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:25:06,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:25:06,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:25:06,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:25:06,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:25:06,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:25:06,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:25:06,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:25:06,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:25:06,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:25:06,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:25:06,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:25:06,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:25:06,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:25:06,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:25:06,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:25:06,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:25:06,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:25:06,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:25:06,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:25:06,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:25:06,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:25:06,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:25:06,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:25:06,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:25:06,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:25:06,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:25:06,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:25:06,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:25:06,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:25:06,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:25:06,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:25:06,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:25:06,959 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:25:06,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:25:06,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:25:06,960 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:25:06,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:25:06,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:25:06,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:25:06,961 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:25:06,961 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:25:06,961 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:25:06,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:25:06,962 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:25:06,962 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:25:06,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:25:06,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:25:06,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:25:06,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:25:06,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:25:06,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:25:06,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:25:06,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:25:06,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:25:06,965 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:25:06,965 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:25:06,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:25:06,969 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_9c440b39-b52b-4ea3-885a-641060433acb/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 -> 961cc3a58fcae29742bbb59c935dd1303821abd8 [2019-11-15 22:25:07,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:25:07,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:25:07,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:25:07,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:25:07,036 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:25:07,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2019-11-15 22:25:07,094 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/f0212fb14/05c4950024fc48a28b506af66778b3b5/FLAG134898488 [2019-11-15 22:25:07,613 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:25:07,614 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2019-11-15 22:25:07,629 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/f0212fb14/05c4950024fc48a28b506af66778b3b5/FLAG134898488 [2019-11-15 22:25:07,962 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/data/f0212fb14/05c4950024fc48a28b506af66778b3b5 [2019-11-15 22:25:07,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:25:07,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:25:07,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:07,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:25:07,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:25:07,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:07" (1/1) ... [2019-11-15 22:25:07,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a17c01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:07, skipping insertion in model container [2019-11-15 22:25:07,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:07" (1/1) ... [2019-11-15 22:25:07,989 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:25:08,053 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:25:08,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:08,571 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:25:08,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:08,735 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:25:08,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08 WrapperNode [2019-11-15 22:25:08,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:08,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:25:08,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:25:08,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:25:08,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... [2019-11-15 22:25:08,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:25:08,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:25:08,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:25:08,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:25:08,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:25:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:25:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:25:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:25:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:25:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:25:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 22:25:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 22:25:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-15 22:25:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_prepend [2019-11-15 22:25:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:25:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:25:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:25:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:25:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:25:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:25:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:25:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:25:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:25:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:25:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:25:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:25:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:25:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:25:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:25:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:25:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:25:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:25:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:25:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:25:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:25:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:25:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:25:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:25:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:25:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:25:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:25:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:25:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:25:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:25:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:25:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:25:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:25:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:25:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:25:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:25:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:25:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:25:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:25:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:25:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:25:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:25:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:25:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:25:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:25:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:25:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:25:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:25:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:25:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:25:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:25:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:25:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:25:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:25:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:25:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:25:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:25:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:25:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:25:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:25:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:25:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:25:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:25:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:25:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:25:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:25:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:25:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:25:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:25:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:25:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:25:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:25:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:25:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:25:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:25:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:25:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:25:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:25:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:25:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:25:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:25:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:25:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:25:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:25:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:25:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:25:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:25:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:25:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:25:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:25:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:25:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 22:25:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:25:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:25:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:25:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 22:25:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-15 22:25:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:25:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:25:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_prepend [2019-11-15 22:25:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:25:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:25:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:25:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:25:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:25:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:25:09,653 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:25:10,286 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:25:10,286 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:25:10,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:10 BoogieIcfgContainer [2019-11-15 22:25:10,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:25:10,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:25:10,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:25:10,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:25:10,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:25:07" (1/3) ... [2019-11-15 22:25:10,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2280b998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:10, skipping insertion in model container [2019-11-15 22:25:10,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:08" (2/3) ... [2019-11-15 22:25:10,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2280b998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:10, skipping insertion in model container [2019-11-15 22:25:10,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:10" (3/3) ... [2019-11-15 22:25:10,298 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2019-11-15 22:25:10,310 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:25:10,319 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-11-15 22:25:10,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-11-15 22:25:10,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:25:10,352 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:25:10,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:25:10,353 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:25:10,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:25:10,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:25:10,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:25:10,354 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:25:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 22:25:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:25:10,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:10,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:25:10,393 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_prependErr18REQUIRES_VIOLATION, dll_circular_prependErr7REQUIRES_VIOLATION, dll_circular_prependErr17REQUIRES_VIOLATION, dll_circular_prependErr19REQUIRES_VIOLATION, dll_circular_prependErr8REQUIRES_VIOLATION, dll_circular_prependErr10REQUIRES_VIOLATION, dll_circular_prependErr20REQUIRES_VIOLATION, dll_circular_prependErr9REQUIRES_VIOLATION, dll_circular_prependErr22REQUIRES_VIOLATION, dll_circular_prependErr11REQUIRES_VIOLATION, dll_circular_prependErr0REQUIRES_VIOLATION, dll_circular_prependErr21REQUIRES_VIOLATION, dll_circular_prependErr2REQUIRES_VIOLATION, dll_circular_prependErr23REQUIRES_VIOLATION, dll_circular_prependErr1REQUIRES_VIOLATION, dll_circular_prependErr12REQUIRES_VIOLATION, dll_circular_prependErr3REQUIRES_VIOLATION, dll_circular_prependErr14REQUIRES_VIOLATION, dll_circular_prependErr13REQUIRES_VIOLATION, dll_circular_prependErr15REQUIRES_VIOLATION, dll_circular_prependErr4REQUIRES_VIOLATION, dll_circular_prependErr6REQUIRES_VIOLATION, dll_circular_prependErr16REQUIRES_VIOLATION, dll_circular_prependErr5REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:25:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -357346190, now seen corresponding path program 1 times [2019-11-15 22:25:10,407 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:10,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1320779164] [2019-11-15 22:25:10,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c440b39-b52b-4ea3-885a-641060433acb/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:10,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:10,647 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:25:10,653 INFO L168 Benchmark]: Toolchain (without parser) took 2685.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -88.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:10,654 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:10,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:10,655 INFO L168 Benchmark]: Boogie Preprocessor took 101.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:10,656 INFO L168 Benchmark]: RCFGBuilder took 1448.96 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: 77.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:10,657 INFO L168 Benchmark]: TraceAbstraction took 361.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:10,660 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 768.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1448.96 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: 77.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 361.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...