./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_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_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 991566e3237a3bd107d157451ed3644c7d9c68a0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 991566e3237a3bd107d157451ed3644c7d9c68a0 ..................................................................................................................................................................................................................................................................................................................................................................... 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 23:30:10,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:30:10,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:30:10,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:30:10,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:30:10,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:30:10,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:30:10,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:30:10,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:30:10,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:30:10,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:30:10,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:30:10,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:30:10,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:30:10,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:30:10,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:30:10,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:30:10,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:30:10,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:30:10,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:30:10,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:30:10,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:30:10,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:30:10,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:30:10,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:30:10,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:30:10,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:30:10,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:30:10,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:30:10,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:30:10,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:30:10,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:30:10,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:30:10,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:30:10,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:30:10,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:30:10,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:30:10,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:30:10,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:30:10,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:30:10,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:30:10,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:30:10,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:30:10,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:30:10,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:30:10,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:30:10,650 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:30:10,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:30:10,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:30:10,651 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:30:10,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:30:10,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:30:10,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:30:10,652 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:30:10,652 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:30:10,652 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:30:10,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:30:10,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:30:10,653 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:30:10,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:30:10,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:30:10,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:30:10,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:30:10,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:30:10,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:30:10,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:30:10,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:30:10,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:30:10,655 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_71051e7a-f7df-47f5-b789-e91514ed3d55/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 -> 991566e3237a3bd107d157451ed3644c7d9c68a0 [2019-11-15 23:30:10,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:30:10,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:30:10,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:30:10,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:30:10,695 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:30:10,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-15 23:30:10,756 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/6af2ab9dd/cb2abf8df57845fcb5eeaa568dc211fa/FLAG0b86281f5 [2019-11-15 23:30:11,247 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:30:11,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-15 23:30:11,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/6af2ab9dd/cb2abf8df57845fcb5eeaa568dc211fa/FLAG0b86281f5 [2019-11-15 23:30:11,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/6af2ab9dd/cb2abf8df57845fcb5eeaa568dc211fa [2019-11-15 23:30:11,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:30:11,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:30:11,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:11,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:30:11,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:30:11,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:11" (1/1) ... [2019-11-15 23:30:11,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16cc098d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:11, skipping insertion in model container [2019-11-15 23:30:11,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:11" (1/1) ... [2019-11-15 23:30:11,735 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:30:11,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:30:12,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:12,155 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:30:12,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:12,258 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:30:12,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12 WrapperNode [2019-11-15 23:30:12,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:12,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:30:12,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:30:12,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:30:12,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... [2019-11-15 23:30:12,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:30:12,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:30:12,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:30:12,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:30:12,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:30:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:30:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:30:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2019-11-15 23:30:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:30:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:30:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:30:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:30:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:30:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:30:12,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:30:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:30:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:30:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:30:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:30:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:30:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:30:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:30:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:30:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:30:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:30:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:30:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:30:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:30:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:30:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:30:12,723 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:30:13,118 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:30:13,118 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:30:13,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:13 BoogieIcfgContainer [2019-11-15 23:30:13,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:30:13,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:30:13,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:30:13,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:30:13,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:30:11" (1/3) ... [2019-11-15 23:30:13,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e3259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:30:13, skipping insertion in model container [2019-11-15 23:30:13,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:12" (2/3) ... [2019-11-15 23:30:13,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e3259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:30:13, skipping insertion in model container [2019-11-15 23:30:13,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:13" (3/3) ... [2019-11-15 23:30:13,127 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2019-11-15 23:30:13,136 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:30:13,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-11-15 23:30:13,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-11-15 23:30:13,177 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:30:13,177 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:30:13,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:30:13,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:30:13,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:30:13,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:30:13,178 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:30:13,178 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:30:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 23:30:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:30:13,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:13,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:13,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash -456220142, now seen corresponding path program 1 times [2019-11-15 23:30:13,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:13,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070946387] [2019-11-15 23:30:13,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:13,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:13,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:13,460 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 23:30:13,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070946387] [2019-11-15 23:30:13,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:13,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:30:13,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835726584] [2019-11-15 23:30:13,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:30:13,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:30:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:30:13,482 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2019-11-15 23:30:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:13,858 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-15 23:30:13,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:30:13,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:30:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:13,870 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:30:13,870 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 23:30:13,877 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 23:30:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 23:30:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 124. [2019-11-15 23:30:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:30:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 23:30:13,948 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 11 [2019-11-15 23:30:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 23:30:13,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:30:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 23:30:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:30:13,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:13,951 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:13,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash -456220143, now seen corresponding path program 1 times [2019-11-15 23:30:13,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:13,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637135446] [2019-11-15 23:30:13,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:13,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:13,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,030 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 23:30:14,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637135446] [2019-11-15 23:30:14,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:14,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:30:14,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707178397] [2019-11-15 23:30:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:30:14,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:30:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:30:14,036 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2019-11-15 23:30:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:14,357 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2019-11-15 23:30:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:30:14,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:30:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:14,360 INFO L225 Difference]: With dead ends: 138 [2019-11-15 23:30:14,360 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 23:30:14,361 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 23:30:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 23:30:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2019-11-15 23:30:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:30:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-15 23:30:14,370 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 11 [2019-11-15 23:30:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:14,371 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-15 23:30:14,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:30:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-15 23:30:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:30:14,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:14,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:14,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1175859563, now seen corresponding path program 1 times [2019-11-15 23:30:14,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:14,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324529431] [2019-11-15 23:30:14,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:14,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:14,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,447 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 23:30:14,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324529431] [2019-11-15 23:30:14,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:14,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:30:14,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185463814] [2019-11-15 23:30:14,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:30:14,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:30:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:30:14,457 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2019-11-15 23:30:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:14,719 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2019-11-15 23:30:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:30:14,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 23:30:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:14,724 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:30:14,724 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:30:14,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:30:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:30:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2019-11-15 23:30:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 23:30:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-11-15 23:30:14,737 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 15 [2019-11-15 23:30:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:14,740 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-11-15 23:30:14,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:30:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-11-15 23:30:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:30:14,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:14,741 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:14,742 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -545594592, now seen corresponding path program 1 times [2019-11-15 23:30:14,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:14,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73479405] [2019-11-15 23:30:14,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:14,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:14,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:14,862 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 23:30:14,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73479405] [2019-11-15 23:30:14,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:14,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:30:14,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893629566] [2019-11-15 23:30:14,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:30:14,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:30:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:30:14,870 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 5 states. [2019-11-15 23:30:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:15,248 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-11-15 23:30:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:30:15,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 23:30:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:15,249 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:30:15,249 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:30:15,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:30:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:30:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2019-11-15 23:30:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:30:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2019-11-15 23:30:15,257 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 19 [2019-11-15 23:30:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2019-11-15 23:30:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:30:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2019-11-15 23:30:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:30:15,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:15,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:15,259 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash -545594591, now seen corresponding path program 1 times [2019-11-15 23:30:15,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:15,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25296125] [2019-11-15 23:30:15,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:15,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:15,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:15,370 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 23:30:15,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25296125] [2019-11-15 23:30:15,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:15,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:30:15,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064765599] [2019-11-15 23:30:15,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:30:15,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:15,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:30:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:15,372 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 7 states. [2019-11-15 23:30:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:15,750 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2019-11-15 23:30:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:30:15,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 23:30:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:15,752 INFO L225 Difference]: With dead ends: 141 [2019-11-15 23:30:15,752 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 23:30:15,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:30:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 23:30:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2019-11-15 23:30:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:30:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 23:30:15,765 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 19 [2019-11-15 23:30:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:15,766 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 23:30:15,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:30:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 23:30:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:30:15,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:15,767 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:15,768 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2049635944, now seen corresponding path program 1 times [2019-11-15 23:30:15,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:15,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028206032] [2019-11-15 23:30:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:15,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:15,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028206032] [2019-11-15 23:30:15,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806217654] [2019-11-15 23:30:15,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:16,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:30:16,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:16,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:16,121 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 23:30:16,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:16,136 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:30:16,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:16,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 23:30:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:16,170 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:16,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-15 23:30:16,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816191088] [2019-11-15 23:30:16,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:30:16,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:30:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:16,172 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 7 states. [2019-11-15 23:30:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:16,524 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2019-11-15 23:30:16,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:30:16,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:30:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:16,526 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:30:16,526 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 23:30:16,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 23:30:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2019-11-15 23:30:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 23:30:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2019-11-15 23:30:16,532 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 22 [2019-11-15 23:30:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:16,532 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2019-11-15 23:30:16,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:30:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2019-11-15 23:30:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:30:16,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:16,534 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:16,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:16,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2049635945, now seen corresponding path program 1 times [2019-11-15 23:30:16,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:16,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610143903] [2019-11-15 23:30:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:16,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:16,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610143903] [2019-11-15 23:30:16,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643969365] [2019-11-15 23:30:16,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:16,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:30:16,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:17,006 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 23:30:17,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:17,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:17,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:17,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:30:17,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:17,080 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 23:30:17,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:17,096 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 23:30:17,097 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 23:30:17,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 23:30:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:17,107 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:17,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 23:30:17,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824740971] [2019-11-15 23:30:17,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:30:17,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:30:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:17,108 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 8 states. [2019-11-15 23:30:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:17,426 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-15 23:30:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:30:17,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 23:30:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:17,428 INFO L225 Difference]: With dead ends: 136 [2019-11-15 23:30:17,428 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 23:30:17,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:30:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 23:30:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-11-15 23:30:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:30:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-11-15 23:30:17,433 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 22 [2019-11-15 23:30:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:17,434 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-11-15 23:30:17,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:30:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-11-15 23:30:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:30:17,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:17,435 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:17,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:17,638 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -932320908, now seen corresponding path program 1 times [2019-11-15 23:30:17,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:17,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743076547] [2019-11-15 23:30:17,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:17,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:17,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:17,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743076547] [2019-11-15 23:30:17,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794127374] [2019-11-15 23:30:17,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:17,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:30:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:17,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:17,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 23:30:17,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277948086] [2019-11-15 23:30:17,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:30:17,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:30:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:30:17,912 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 9 states. [2019-11-15 23:30:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:18,253 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2019-11-15 23:30:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:30:18,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 23:30:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:18,255 INFO L225 Difference]: With dead ends: 147 [2019-11-15 23:30:18,255 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:30:18,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:30:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:30:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2019-11-15 23:30:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:30:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 23:30:18,260 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 26 [2019-11-15 23:30:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:18,260 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 23:30:18,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:30:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 23:30:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:30:18,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:18,262 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] [2019-11-15 23:30:18,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:18,473 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:18,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1831448513, now seen corresponding path program 2 times [2019-11-15 23:30:18,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:18,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069150470] [2019-11-15 23:30:18,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:18,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:18,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:18,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069150470] [2019-11-15 23:30:18,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126586926] [2019-11-15 23:30:18,586 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:18,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 23:30:18,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:30:18,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:30:18,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:18,723 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 23:30:18,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:18,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:18,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:18,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:30:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:18,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:30:18,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 23:30:18,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533863618] [2019-11-15 23:30:18,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:30:18,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:30:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:18,748 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 3 states. [2019-11-15 23:30:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:18,823 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2019-11-15 23:30:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:30:18,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 23:30:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:18,824 INFO L225 Difference]: With dead ends: 121 [2019-11-15 23:30:18,824 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 23:30:18,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 23:30:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 23:30:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:30:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-15 23:30:18,829 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 33 [2019-11-15 23:30:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:18,829 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-15 23:30:18,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:30:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-15 23:30:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:30:18,831 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:18,831 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, 1, 1, 1, 1] [2019-11-15 23:30:19,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:19,035 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1538902553, now seen corresponding path program 1 times [2019-11-15 23:30:19,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:19,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955509486] [2019-11-15 23:30:19,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:19,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:19,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955509486] [2019-11-15 23:30:19,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360100955] [2019-11-15 23:30:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:19,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:30:19,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:19,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:19,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 23:30:19,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64218547] [2019-11-15 23:30:19,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:30:19,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:30:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:30:19,308 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 6 states. [2019-11-15 23:30:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:19,696 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2019-11-15 23:30:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:30:19,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-15 23:30:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:19,698 INFO L225 Difference]: With dead ends: 134 [2019-11-15 23:30:19,698 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 23:30:19,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 23:30:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-11-15 23:30:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:30:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2019-11-15 23:30:19,703 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 40 [2019-11-15 23:30:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:19,706 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2019-11-15 23:30:19,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:30:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2019-11-15 23:30:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:30:19,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:19,710 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:19,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:19,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -930251750, now seen corresponding path program 1 times [2019-11-15 23:30:19,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:19,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516123410] [2019-11-15 23:30:19,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:19,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:19,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:20,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516123410] [2019-11-15 23:30:20,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122831133] [2019-11-15 23:30:20,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:20,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:30:20,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:20,456 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 23:30:20,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:20,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:30:20,475 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 23:30:20,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:20,486 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 23:30:20,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:30:20,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:20,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:20,616 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:30:20,617 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 23:30:20,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:20,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 23:30:20,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-15 23:30:20,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:20,790 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 23:30:20,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:20,802 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 23:30:20,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 23:30:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:20,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:20,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:20,875 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 23:30:20,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:20,908 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 23:30:20,909 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 23:30:20,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-15 23:30:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:20,974 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:20,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 23:30:20,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077994530] [2019-11-15 23:30:20,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:30:20,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:20,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:30:20,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:30:20,976 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 18 states. [2019-11-15 23:30:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:22,660 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2019-11-15 23:30:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:30:22,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-15 23:30:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:22,662 INFO L225 Difference]: With dead ends: 219 [2019-11-15 23:30:22,662 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 23:30:22,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:30:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 23:30:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2019-11-15 23:30:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 23:30:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2019-11-15 23:30:22,704 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 41 [2019-11-15 23:30:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:22,704 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2019-11-15 23:30:22,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:30:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2019-11-15 23:30:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:30:22,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:22,711 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:22,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:22,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash -930251749, now seen corresponding path program 1 times [2019-11-15 23:30:22,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:22,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904772074] [2019-11-15 23:30:22,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:22,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:22,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:23,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904772074] [2019-11-15 23:30:23,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093333101] [2019-11-15 23:30:23,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:23,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:30:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:23,431 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 23:30:23,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:23,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:30:23,448 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 23:30:23,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:23,454 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 23:30:23,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:30:23,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:23,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:23,569 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:30:23,570 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 23:30:23,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:23,585 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 23:30:23,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-15 23:30:23,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:23,705 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 23:30:23,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:23,712 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 23:30:23,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 23:30:23,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:23,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:23,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:23,774 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 23:30:23,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:23,802 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 23:30:23,802 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 23:30:23,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-15 23:30:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:23,837 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:23,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-15 23:30:23,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621887270] [2019-11-15 23:30:23,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:30:23,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:23,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:30:23,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:30:23,839 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand 17 states. [2019-11-15 23:30:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:25,051 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2019-11-15 23:30:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:30:25,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-15 23:30:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:25,054 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:30:25,054 INFO L226 Difference]: Without dead ends: 224 [2019-11-15 23:30:25,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:30:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-15 23:30:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2019-11-15 23:30:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 23:30:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 194 transitions. [2019-11-15 23:30:25,061 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 194 transitions. Word has length 41 [2019-11-15 23:30:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:25,061 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 194 transitions. [2019-11-15 23:30:25,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:30:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 194 transitions. [2019-11-15 23:30:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:30:25,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:25,062 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:25,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:25,266 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2000885204, now seen corresponding path program 1 times [2019-11-15 23:30:25,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:25,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11062004] [2019-11-15 23:30:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:25,773 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 23:30:25,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11062004] [2019-11-15 23:30:25,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:25,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-15 23:30:25,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042599514] [2019-11-15 23:30:25,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:30:25,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:30:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:30:25,776 INFO L87 Difference]: Start difference. First operand 163 states and 194 transitions. Second operand 18 states. [2019-11-15 23:30:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:27,772 INFO L93 Difference]: Finished difference Result 230 states and 282 transitions. [2019-11-15 23:30:27,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:30:27,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-11-15 23:30:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:27,775 INFO L225 Difference]: With dead ends: 230 [2019-11-15 23:30:27,775 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 23:30:27,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:30:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 23:30:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 179. [2019-11-15 23:30:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:30:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 232 transitions. [2019-11-15 23:30:27,787 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 232 transitions. Word has length 44 [2019-11-15 23:30:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:27,787 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 232 transitions. [2019-11-15 23:30:27,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:30:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 232 transitions. [2019-11-15 23:30:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:30:27,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:27,788 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:27,789 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2000885203, now seen corresponding path program 1 times [2019-11-15 23:30:27,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:27,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567465727] [2019-11-15 23:30:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:28,790 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 23:30:28,804 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 23:30:28,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567465727] [2019-11-15 23:30:28,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:28,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 23:30:28,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452229608] [2019-11-15 23:30:28,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:30:28,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:30:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:30:28,807 INFO L87 Difference]: Start difference. First operand 179 states and 232 transitions. Second operand 19 states. [2019-11-15 23:30:29,229 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:30:29,591 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 23:30:30,752 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:30:31,098 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 23:30:31,574 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 23:30:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:33,477 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2019-11-15 23:30:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:30:33,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-11-15 23:30:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:33,479 INFO L225 Difference]: With dead ends: 230 [2019-11-15 23:30:33,479 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 23:30:33,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:30:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 23:30:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 179. [2019-11-15 23:30:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:30:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2019-11-15 23:30:33,487 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 44 [2019-11-15 23:30:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:33,487 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2019-11-15 23:30:33,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:30:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2019-11-15 23:30:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:30:33,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:33,489 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:33,489 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1897900798, now seen corresponding path program 1 times [2019-11-15 23:30:33,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:33,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250158756] [2019-11-15 23:30:33,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:33,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:33,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:33,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250158756] [2019-11-15 23:30:33,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:33,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:30:33,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083472587] [2019-11-15 23:30:33,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:30:33,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:30:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:30:33,575 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand 5 states. [2019-11-15 23:30:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:33,929 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2019-11-15 23:30:33,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:30:33,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:30:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:33,931 INFO L225 Difference]: With dead ends: 186 [2019-11-15 23:30:33,931 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:30:33,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:30:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:30:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-15 23:30:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 23:30:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2019-11-15 23:30:33,939 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 45 [2019-11-15 23:30:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:33,939 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2019-11-15 23:30:33,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:30:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2019-11-15 23:30:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:30:33,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:33,945 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:33,946 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1294637295, now seen corresponding path program 1 times [2019-11-15 23:30:33,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:33,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949555857] [2019-11-15 23:30:33,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:33,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:34,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949555857] [2019-11-15 23:30:34,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:34,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:30:34,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564420311] [2019-11-15 23:30:34,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:30:34,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:30:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:34,081 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 7 states. [2019-11-15 23:30:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:34,502 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2019-11-15 23:30:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:30:34,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-15 23:30:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:34,504 INFO L225 Difference]: With dead ends: 180 [2019-11-15 23:30:34,504 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 23:30:34,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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 23:30:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 23:30:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-11-15 23:30:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 23:30:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2019-11-15 23:30:34,516 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 46 [2019-11-15 23:30:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:34,516 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2019-11-15 23:30:34,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:30:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2019-11-15 23:30:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:30:34,517 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:34,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:34,518 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1480006567, now seen corresponding path program 1 times [2019-11-15 23:30:34,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:34,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360265744] [2019-11-15 23:30:34,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:34,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360265744] [2019-11-15 23:30:34,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:34,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:30:34,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190915611] [2019-11-15 23:30:34,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:30:34,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:30:34,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:34,637 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand 8 states. [2019-11-15 23:30:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:35,083 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-11-15 23:30:35,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:30:35,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-15 23:30:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:35,086 INFO L225 Difference]: With dead ends: 176 [2019-11-15 23:30:35,086 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 23:30:35,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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 23:30:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 23:30:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2019-11-15 23:30:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 23:30:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2019-11-15 23:30:35,094 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 47 [2019-11-15 23:30:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:35,095 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2019-11-15 23:30:35,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:30:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2019-11-15 23:30:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:30:35,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:35,096 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:35,097 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1364438297, now seen corresponding path program 1 times [2019-11-15 23:30:35,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:35,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427057088] [2019-11-15 23:30:35,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:35,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427057088] [2019-11-15 23:30:35,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:35,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:30:35,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444606345] [2019-11-15 23:30:35,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:30:35,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:30:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:30:35,195 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand 6 states. [2019-11-15 23:30:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:35,537 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2019-11-15 23:30:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:30:35,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-15 23:30:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:35,539 INFO L225 Difference]: With dead ends: 179 [2019-11-15 23:30:35,539 INFO L226 Difference]: Without dead ends: 179 [2019-11-15 23:30:35,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-15 23:30:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2019-11-15 23:30:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 23:30:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2019-11-15 23:30:35,547 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 48 [2019-11-15 23:30:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:35,550 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2019-11-15 23:30:35,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:30:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2019-11-15 23:30:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:30:35,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:35,551 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:35,552 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1364438296, now seen corresponding path program 1 times [2019-11-15 23:30:35,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:35,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138628262] [2019-11-15 23:30:35,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:30:35,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138628262] [2019-11-15 23:30:35,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:35,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:30:35,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638155249] [2019-11-15 23:30:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:30:35,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:30:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:30:35,661 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand 6 states. [2019-11-15 23:30:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:35,986 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2019-11-15 23:30:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:30:35,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-15 23:30:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:35,987 INFO L225 Difference]: With dead ends: 174 [2019-11-15 23:30:35,987 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 23:30:35,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 23:30:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2019-11-15 23:30:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 23:30:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-11-15 23:30:35,993 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 48 [2019-11-15 23:30:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:35,994 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-11-15 23:30:35,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:30:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-11-15 23:30:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:30:35,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:35,995 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:35,995 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 652085781, now seen corresponding path program 1 times [2019-11-15 23:30:35,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:35,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928910529] [2019-11-15 23:30:35,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:35,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:30:36,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928910529] [2019-11-15 23:30:36,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:36,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:30:36,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353513408] [2019-11-15 23:30:36,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:30:36,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:30:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:30:36,111 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 8 states. [2019-11-15 23:30:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:36,602 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2019-11-15 23:30:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:30:36,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-15 23:30:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:36,604 INFO L225 Difference]: With dead ends: 171 [2019-11-15 23:30:36,604 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 23:30:36,605 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 23:30:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 23:30:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-11-15 23:30:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 23:30:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2019-11-15 23:30:36,610 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 49 [2019-11-15 23:30:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:36,610 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2019-11-15 23:30:36,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:30:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2019-11-15 23:30:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:30:36,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:36,611 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:36,612 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 652085782, now seen corresponding path program 1 times [2019-11-15 23:30:36,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:36,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942709697] [2019-11-15 23:30:36,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:36,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:36,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:30:36,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942709697] [2019-11-15 23:30:36,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:36,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:30:36,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350428282] [2019-11-15 23:30:36,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:30:36,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:36,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:30:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:30:36,798 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 9 states. [2019-11-15 23:30:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:37,410 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2019-11-15 23:30:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:30:37,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-15 23:30:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:37,413 INFO L225 Difference]: With dead ends: 168 [2019-11-15 23:30:37,413 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 23:30:37,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:30:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 23:30:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-11-15 23:30:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 23:30:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2019-11-15 23:30:37,420 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 49 [2019-11-15 23:30:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:37,420 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2019-11-15 23:30:37,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:30:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2019-11-15 23:30:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:30:37,421 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:37,421 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:37,422 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1949487918, now seen corresponding path program 2 times [2019-11-15 23:30:37,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:37,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238034247] [2019-11-15 23:30:37,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:37,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:37,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:37,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238034247] [2019-11-15 23:30:37,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680993953] [2019-11-15 23:30:37,595 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:37,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:30:37,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:30:37,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:30:37,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:37,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:37,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 23:30:37,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797432754] [2019-11-15 23:30:37,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:30:37,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:30:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:30:37,793 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 10 states. [2019-11-15 23:30:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:38,109 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-15 23:30:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:30:38,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-11-15 23:30:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:30:38,112 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:30:38,112 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:30:38,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:30:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:30:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2019-11-15 23:30:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 23:30:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-11-15 23:30:38,115 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 49 [2019-11-15 23:30:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:30:38,115 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-11-15 23:30:38,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:30:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-11-15 23:30:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:30:38,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:30:38,116 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:38,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:38,322 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:30:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 150452907, now seen corresponding path program 1 times [2019-11-15 23:30:38,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:38,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847386030] [2019-11-15 23:30:38,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:38,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:38,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:39,614 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 23:30:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:39,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847386030] [2019-11-15 23:30:39,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112703173] [2019-11-15 23:30:39,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:30:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:39,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 23:30:39,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:39,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:39,836 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 11 treesize of output 15 [2019-11-15 23:30:39,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:39,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:39,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:39,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 23:30:39,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:30:39,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:39,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:39,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:39,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:30:39,975 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 23:30:39,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:39,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:39,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:39,984 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 18 treesize of output 22 [2019-11-15 23:30:39,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:39,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:39,991 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2019-11-15 23:30:40,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:40,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,100 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 56 treesize of output 111 [2019-11-15 23:30:40,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,144 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.0 percent of original size [2019-11-15 23:30:40,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:40,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:54 [2019-11-15 23:30:40,663 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 23 treesize of output 7 [2019-11-15 23:30:40,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,681 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_2|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_2|]} [2019-11-15 23:30:40,688 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 23:30:40,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 59 [2019-11-15 23:30:40,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,729 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:40,771 INFO L567 ElimStorePlain]: treesize reduction 28, result has 37.8 percent of original size [2019-11-15 23:30:40,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:90, output treesize:10 [2019-11-15 23:31:13,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:13,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 129 [2019-11-15 23:31:13,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:14,011 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 23:31:14,011 INFO L567 ElimStorePlain]: treesize reduction 64, result has 71.6 percent of original size [2019-11-15 23:31:14,013 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_12|], 34=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_12|]} [2019-11-15 23:31:14,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,028 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 33 treesize of output 29 [2019-11-15 23:31:14,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:14,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:14,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,442 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-11-15 23:31:14,442 INFO L341 Elim1Store]: treesize reduction 139, result has 65.7 percent of original size [2019-11-15 23:31:14,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 116 treesize of output 325 [2019-11-15 23:31:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:31:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:31:14,469 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 23:31:14,596 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-11-15 23:31:14,596 INFO L567 ElimStorePlain]: treesize reduction 300, result has 29.6 percent of original size [2019-11-15 23:31:14,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:31:14,597 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:147, output treesize:147 [2019-11-15 23:31:14,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:14,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-15 23:31:14,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:14,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:14,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:31:14,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:158, output treesize:129 [2019-11-15 23:31:15,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:31:15,235 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-15 23:31:15,235 INFO L341 Elim1Store]: treesize reduction 12, result has 91.6 percent of original size [2019-11-15 23:31:15,236 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 8 new quantified variables, introduced 13 case distinctions, treesize of input 120 treesize of output 174 [2019-11-15 23:31:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:15,264 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 23:31:15,324 INFO L567 ElimStorePlain]: treesize reduction 88, result has 27.3 percent of original size [2019-11-15 23:31:15,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:31:15,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:28 [2019-11-15 23:31:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:15,544 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:31:15,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2019-11-15 23:31:15,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394613372] [2019-11-15 23:31:15,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 23:31:15,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:31:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 23:31:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1823, Unknown=16, NotChecked=0, Total=1980 [2019-11-15 23:31:15,550 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 45 states. [2019-11-15 23:31:20,287 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 23:31:29,100 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 23:32:07,276 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-15 23:32:09,526 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 23:32:11,803 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 23:32:14,077 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 23:32:18,567 WARN L191 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2019-11-15 23:32:22,964 WARN L191 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-15 23:32:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:50,792 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-11-15 23:32:50,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:32:50,793 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-11-15 23:32:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:50,794 INFO L225 Difference]: With dead ends: 110 [2019-11-15 23:32:50,794 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 23:32:50,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=326, Invalid=3560, Unknown=20, NotChecked=0, Total=3906 [2019-11-15 23:32:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 23:32:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2019-11-15 23:32:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 23:32:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-11-15 23:32:50,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 52 [2019-11-15 23:32:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:50,799 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-11-15 23:32:50,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 23:32:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-11-15 23:32:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:32:50,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:50,800 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:51,005 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:32:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 150452908, now seen corresponding path program 1 times [2019-11-15 23:32:51,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825986696] [2019-11-15 23:32:51,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,857 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 23:32:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:52,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825986696] [2019-11-15 23:32:52,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728467735] [2019-11-15 23:32:52,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:32:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 105 conjunts are in the unsatisfiable core [2019-11-15 23:32:53,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:53,069 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 23:32:53,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:32:53,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,213 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 12 treesize of output 14 [2019-11-15 23:32:53,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,231 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 11 treesize of output 15 [2019-11-15 23:32:53,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-11-15 23:32:53,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:32:53,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:32:53,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2019-11-15 23:32:53,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:32:53,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:32:53,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,552 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2019-11-15 23:32:53,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:32:53,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,654 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 1 case distinctions, treesize of input 112 treesize of output 99 [2019-11-15 23:32:53,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,731 INFO L567 ElimStorePlain]: treesize reduction 39, result has 77.7 percent of original size [2019-11-15 23:32:53,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:53,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2019-11-15 23:32:53,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:53,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:53,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:155, output treesize:126 [2019-11-15 23:32:54,581 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_10|], 1=[|v_#length_BEFORE_CALL_7|]} [2019-11-15 23:32:54,588 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 23:32:54,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:54,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:54,643 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 64 treesize of output 26 [2019-11-15 23:32:54,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:54,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:54,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:54,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:54,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:32:54,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:54,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 142 [2019-11-15 23:32:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,718 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:32:54,787 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.5 percent of original size [2019-11-15 23:32:54,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:54,819 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 4 case distinctions, treesize of input 77 treesize of output 78 [2019-11-15 23:32:54,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:32:54,824 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:54,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:54,844 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 23:32:54,844 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:257, output treesize:13 [2019-11-15 23:33:30,280 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 23:33:30,283 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_11|], 3=[|v_#length_BEFORE_CALL_8|]} [2019-11-15 23:33:30,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,304 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 23:33:30,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,434 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 23:33:30,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,467 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 70 treesize of output 115 [2019-11-15 23:33:30,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,755 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 23:33:30,755 INFO L567 ElimStorePlain]: treesize reduction 56, result has 83.6 percent of original size [2019-11-15 23:33:30,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:30,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:31,187 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-11-15 23:33:31,187 INFO L341 Elim1Store]: treesize reduction 189, result has 65.1 percent of original size [2019-11-15 23:33:31,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 234 treesize of output 484 [2019-11-15 23:33:31,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:33:31,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:31,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,227 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 23:33:31,617 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 77 [2019-11-15 23:33:31,617 INFO L567 ElimStorePlain]: treesize reduction 448, result has 41.2 percent of original size [2019-11-15 23:33:31,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:31,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:31,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:31,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:31,782 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-15 23:33:31,783 INFO L341 Elim1Store]: treesize reduction 43, result has 73.9 percent of original size [2019-11-15 23:33:31,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 253 treesize of output 273 [2019-11-15 23:33:31,787 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,996 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-11-15 23:33:31,996 INFO L567 ElimStorePlain]: treesize reduction 278, result has 54.4 percent of original size [2019-11-15 23:33:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:32,000 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 23:33:32,000 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:311, output treesize:426 [2019-11-15 23:33:32,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:32,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:32,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:32,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:33,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:33:33,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,405 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 23:33:33,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 303 treesize of output 328 [2019-11-15 23:33:33,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,445 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 23:33:33,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 375 treesize of output 291 [2019-11-15 23:33:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,606 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 23:33:33,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 375 treesize of output 291 [2019-11-15 23:33:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,792 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 23:33:33,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:33,916 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 23:33:33,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,917 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 10 case distinctions, treesize of input 334 treesize of output 276 [2019-11-15 23:33:33,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:33,932 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:34,395 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 145 [2019-11-15 23:33:34,396 INFO L567 ElimStorePlain]: treesize reduction 457, result has 55.7 percent of original size [2019-11-15 23:33:34,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 88 [2019-11-15 23:33:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:34,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:34,443 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,516 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 85 [2019-11-15 23:33:34,517 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:33:34,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 88 [2019-11-15 23:33:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:34,576 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:34,782 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 23:33:34,786 INFO L168 Benchmark]: Toolchain (without parser) took 203066.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -252.9 MB). Peak memory consumption was 448.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:34,786 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:34,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:34,787 INFO L168 Benchmark]: Boogie Preprocessor took 68.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:34,787 INFO L168 Benchmark]: RCFGBuilder took 791.94 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:34,787 INFO L168 Benchmark]: TraceAbstraction took 201664.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -159.0 MB). Peak memory consumption was 410.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:34,789 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 791.94 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 201664.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -159.0 MB). Peak memory consumption was 410.1 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 23:33:37,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:37,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:37,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:37,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:37,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:37,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:37,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:37,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:37,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:37,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:37,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:37,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:37,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:37,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:37,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:37,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:37,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:37,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:37,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:37,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:37,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:37,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:37,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:37,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:37,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:37,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:37,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:37,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:37,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:37,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:37,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:37,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:37,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:37,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:37,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:37,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:37,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:37,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:37,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:37,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:37,338 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 23:33:37,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:37,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:37,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:37,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:37,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:37,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:37,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:33:37,381 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:33:37,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:33:37,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:33:37,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:37,382 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:33:37,382 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:33:37,382 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:33:37,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:33:37,383 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:33:37,383 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:33:37,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:33:37,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:37,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:37,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:37,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:33:37,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:33:37,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:33:37,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:37,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:33:37,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:33:37,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:33:37,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:33:37,387 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_71051e7a-f7df-47f5-b789-e91514ed3d55/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 -> 991566e3237a3bd107d157451ed3644c7d9c68a0 [2019-11-15 23:33:37,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:37,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:37,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:37,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:37,435 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:37,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-15 23:33:37,494 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/74b72d3a1/8d0c4396a0b84d119670ec7808b69949/FLAG0b078b429 [2019-11-15 23:33:37,973 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:37,974 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-15 23:33:37,986 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/74b72d3a1/8d0c4396a0b84d119670ec7808b69949/FLAG0b078b429 [2019-11-15 23:33:38,275 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/bin/uautomizer/data/74b72d3a1/8d0c4396a0b84d119670ec7808b69949 [2019-11-15 23:33:38,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:38,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:33:38,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:38,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:38,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:38,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:38" (1/1) ... [2019-11-15 23:33:38,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dff8f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:38, skipping insertion in model container [2019-11-15 23:33:38,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:38" (1/1) ... [2019-11-15 23:33:38,296 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:38,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:38,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:38,884 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:38,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:39,016 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:39,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39 WrapperNode [2019-11-15 23:33:39,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:39,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:39,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:39,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:39,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... [2019-11-15 23:33:39,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:39,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:39,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:39,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:39,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:33:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:33:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:33:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:33:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:33:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:33:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 23:33:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-15 23:33:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2019-11-15 23:33:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:33:39,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:33:39,180 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:33:39,180 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:33:39,180 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:33:39,180 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:33:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:33:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:33:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:33:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:33:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:33:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:33:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:33:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:33:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:33:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:33:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:33:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:33:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:33:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:33:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:33:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:33:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:33:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:33:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:33:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:33:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:33:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:33:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:33:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:33:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:33:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:33:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:33:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:33:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:33:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:33:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:33:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:33:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:33:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:33:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:33:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:33:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:33:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:33:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:33:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:33:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:33:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:33:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:33:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:33:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:33:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:33:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:33:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:33:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:33:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:33:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:33:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:33:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:33:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:33:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:33:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:33:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:33:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:33:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:33:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:33:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:33:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:33:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:33:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:33:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:33:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:33:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:33:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:33:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:33:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:33:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:33:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:33:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:33:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:33:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:33:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:33:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:33:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:33:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:33:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:33:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:33:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:33:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:33:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:33:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:33:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:33:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:33:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:33:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:33:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:33:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 23:33:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-15 23:33:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:33:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:33:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:33:39,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:39,681 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:33:40,307 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:33:40,307 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:33:40,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:40 BoogieIcfgContainer [2019-11-15 23:33:40,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:33:40,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:33:40,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:33:40,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:33:40,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:33:38" (1/3) ... [2019-11-15 23:33:40,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e13b9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:40, skipping insertion in model container [2019-11-15 23:33:40,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:39" (2/3) ... [2019-11-15 23:33:40,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e13b9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:40, skipping insertion in model container [2019-11-15 23:33:40,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:40" (3/3) ... [2019-11-15 23:33:40,317 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2019-11-15 23:33:40,326 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:33:40,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-11-15 23:33:40,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-11-15 23:33:40,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:33:40,368 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:33:40,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:33:40,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:33:40,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:33:40,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:33:40,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:33:40,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:33:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 23:33:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:33:40,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:40,399 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:40,402 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:33:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -456220142, now seen corresponding path program 1 times [2019-11-15 23:33:40,419 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:33:40,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [76825281] [2019-11-15 23:33:40,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71051e7a-f7df-47f5-b789-e91514ed3d55/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 23:33:40,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:33:40,661 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 23:33:40,665 INFO L168 Benchmark]: Toolchain (without parser) took 2385.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:40,665 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:40,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:40,667 INFO L168 Benchmark]: Boogie Preprocessor took 99.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:40,668 INFO L168 Benchmark]: RCFGBuilder took 1191.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 74.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:40,669 INFO L168 Benchmark]: TraceAbstraction took 352.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:40,672 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 737.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1191.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 74.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 352.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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...