./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_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_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 ..................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:44:00,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:00,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:00,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:00,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:00,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:00,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:00,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:00,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:00,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:00,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:00,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:00,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:00,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:00,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:00,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:00,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:00,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:00,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:00,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:00,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:00,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:00,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:00,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:00,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:00,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:00,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:00,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:00,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:00,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:00,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:00,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:00,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:00,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:00,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:00,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:00,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:00,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:00,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:00,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:00,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:00,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:44:00,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:00,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:00,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:00,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:00,603 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:00,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:00,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:44:00,604 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:44:00,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:00,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:44:00,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:00,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:44:00,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:44:00,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:44:00,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:44:00,607 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:44:00,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:00,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:00,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:00,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:44:00,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:44:00,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:00,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:00,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:44:00,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:00,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:44:00,610 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_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2019-11-16 00:44:00,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:00,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:00,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:00,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:00,660 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:00,661 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:44:00,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/cd7615cc9/da3404f6b04a481bba2dc64b173f4612/FLAGd27d11bc1 [2019-11-16 00:44:01,198 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:01,199 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:44:01,214 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/cd7615cc9/da3404f6b04a481bba2dc64b173f4612/FLAGd27d11bc1 [2019-11-16 00:44:01,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/cd7615cc9/da3404f6b04a481bba2dc64b173f4612 [2019-11-16 00:44:01,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:01,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:44:01,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:01,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:01,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:01,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:01" (1/1) ... [2019-11-16 00:44:01,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334c694f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:01, skipping insertion in model container [2019-11-16 00:44:01,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:01" (1/1) ... [2019-11-16 00:44:01,542 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:01,585 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:01,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:01,989 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:02,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:02,087 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:02,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02 WrapperNode [2019-11-16 00:44:02,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:02,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:02,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:02,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:02,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... [2019-11-16 00:44:02,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:02,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:02,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:02,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:02,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:02,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:44:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:44:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:44:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:44:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:44:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:44:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:44:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2019-11-16 00:44:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:44:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:44:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:44:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:44:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:44:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:44:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:44:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:44:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:44:02,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:44:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:44:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:44:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:44:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:44:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:44:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:44:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:44:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:44:02,221 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:44:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:44:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:44:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:44:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:44:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:44:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:44:02,224 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:44:02,224 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:44:02,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:44:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:44:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:44:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:44:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:44:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:44:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:44:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:44:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:44:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:44:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:44:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:44:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:44:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:44:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:44:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:44:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:44:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:44:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:44:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:44:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:44:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:44:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:44:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:44:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:44:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:44:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:44:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:44:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:44:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:44:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:44:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:44:02,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:44:02,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2019-11-16 00:44:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:44:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:44:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:44:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:02,711 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:44:03,197 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:03,198 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:44:03,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:03 BoogieIcfgContainer [2019-11-16 00:44:03,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:03,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:44:03,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:44:03,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:44:03,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:44:01" (1/3) ... [2019-11-16 00:44:03,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573691af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:03, skipping insertion in model container [2019-11-16 00:44:03,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:02" (2/3) ... [2019-11-16 00:44:03,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573691af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:03, skipping insertion in model container [2019-11-16 00:44:03,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:03" (3/3) ... [2019-11-16 00:44:03,214 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2019-11-16 00:44:03,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:44:03,233 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-16 00:44:03,245 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-16 00:44:03,265 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:44:03,265 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:44:03,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:44:03,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:03,266 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:03,266 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:44:03,266 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:03,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:44:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-11-16 00:44:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:44:03,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:03,299 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:03,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash 823163794, now seen corresponding path program 1 times [2019-11-16 00:44:03,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:03,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676150024] [2019-11-16 00:44:03,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:03,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:03,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:03,527 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-16 00:44:03,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676150024] [2019-11-16 00:44:03,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:03,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:03,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857206284] [2019-11-16 00:44:03,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:03,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:03,551 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2019-11-16 00:44:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:04,009 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-11-16 00:44:04,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:04,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:44:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:04,034 INFO L225 Difference]: With dead ends: 149 [2019-11-16 00:44:04,034 INFO L226 Difference]: Without dead ends: 142 [2019-11-16 00:44:04,036 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-16 00:44:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-16 00:44:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2019-11-16 00:44:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-16 00:44:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2019-11-16 00:44:04,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 12 [2019-11-16 00:44:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:04,104 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2019-11-16 00:44:04,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2019-11-16 00:44:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:44:04,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:04,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:04,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash 823163795, now seen corresponding path program 1 times [2019-11-16 00:44:04,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:04,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672752891] [2019-11-16 00:44:04,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:04,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:04,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:04,205 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-16 00:44:04,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672752891] [2019-11-16 00:44:04,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:04,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:04,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920966182] [2019-11-16 00:44:04,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:04,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:04,209 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2019-11-16 00:44:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:04,667 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-11-16 00:44:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:04,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:44:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:04,670 INFO L225 Difference]: With dead ends: 140 [2019-11-16 00:44:04,670 INFO L226 Difference]: Without dead ends: 140 [2019-11-16 00:44:04,671 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-16 00:44:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-16 00:44:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2019-11-16 00:44:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-16 00:44:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-16 00:44:04,701 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 12 [2019-11-16 00:44:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:04,702 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-16 00:44:04,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-16 00:44:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:44:04,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:04,704 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-16 00:44:04,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1638372873, now seen corresponding path program 1 times [2019-11-16 00:44:04,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:04,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437686559] [2019-11-16 00:44:04,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:04,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:04,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:04,917 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-16 00:44:04,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437686559] [2019-11-16 00:44:04,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:04,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:04,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109973173] [2019-11-16 00:44:04,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:04,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:04,920 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 8 states. [2019-11-16 00:44:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:05,730 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-11-16 00:44:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:05,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:44:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:05,733 INFO L225 Difference]: With dead ends: 144 [2019-11-16 00:44:05,733 INFO L226 Difference]: Without dead ends: 144 [2019-11-16 00:44:05,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-16 00:44:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-16 00:44:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2019-11-16 00:44:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-16 00:44:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-11-16 00:44:05,755 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 19 [2019-11-16 00:44:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:05,755 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-11-16 00:44:05,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-11-16 00:44:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:44:05,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:05,757 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-16 00:44:05,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1638372874, now seen corresponding path program 1 times [2019-11-16 00:44:05,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:05,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670353713] [2019-11-16 00:44:05,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:05,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:05,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:05,953 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-16 00:44:05,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670353713] [2019-11-16 00:44:05,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:05,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:05,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490745069] [2019-11-16 00:44:05,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:44:05,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:44:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:05,971 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2019-11-16 00:44:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:06,497 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2019-11-16 00:44:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:44:06,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:44:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:06,499 INFO L225 Difference]: With dead ends: 141 [2019-11-16 00:44:06,499 INFO L226 Difference]: Without dead ends: 141 [2019-11-16 00:44:06,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:44:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-16 00:44:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2019-11-16 00:44:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-16 00:44:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-11-16 00:44:06,510 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 19 [2019-11-16 00:44:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:06,511 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-11-16 00:44:06,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:44:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-11-16 00:44:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:44:06,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:06,513 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] [2019-11-16 00:44:06,513 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash 34280370, now seen corresponding path program 1 times [2019-11-16 00:44:06,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:06,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459888330] [2019-11-16 00:44:06,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:44:06,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459888330] [2019-11-16 00:44:06,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:06,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:06,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187797258] [2019-11-16 00:44:06,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:06,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:06,663 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 8 states. [2019-11-16 00:44:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:07,249 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-16 00:44:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:07,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:44:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:07,251 INFO L225 Difference]: With dead ends: 141 [2019-11-16 00:44:07,251 INFO L226 Difference]: Without dead ends: 141 [2019-11-16 00:44:07,251 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-16 00:44:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-16 00:44:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2019-11-16 00:44:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-16 00:44:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-16 00:44:07,261 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 28 [2019-11-16 00:44:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:07,262 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-16 00:44:07,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-16 00:44:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:44:07,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:07,264 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] [2019-11-16 00:44:07,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 34280371, now seen corresponding path program 1 times [2019-11-16 00:44:07,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:07,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110689799] [2019-11-16 00:44:07,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:44:07,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110689799] [2019-11-16 00:44:07,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:07,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:07,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175312870] [2019-11-16 00:44:07,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:07,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:07,408 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 8 states. [2019-11-16 00:44:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:07,928 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-11-16 00:44:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:07,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:44:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:07,932 INFO L225 Difference]: With dead ends: 140 [2019-11-16 00:44:07,932 INFO L226 Difference]: Without dead ends: 140 [2019-11-16 00:44:07,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-16 00:44:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-16 00:44:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2019-11-16 00:44:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-16 00:44:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2019-11-16 00:44:07,942 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 28 [2019-11-16 00:44:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:07,942 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2019-11-16 00:44:07,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2019-11-16 00:44:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:44:07,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:07,944 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] [2019-11-16 00:44:07,945 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash -955558121, now seen corresponding path program 1 times [2019-11-16 00:44:07,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:07,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267614456] [2019-11-16 00:44:07,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:08,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267614456] [2019-11-16 00:44:08,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831113672] [2019-11-16 00:44:08,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:08,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:44:08,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:08,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:08,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:08,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-16 00:44:08,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:08,406 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:44:08,407 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-16 00:44:08,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:44:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:44:08,417 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:08,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:44:08,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497557392] [2019-11-16 00:44:08,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:44:08,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:44:08,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:44:08,419 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 12 states. [2019-11-16 00:44:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:09,260 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-11-16 00:44:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:44:09,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-16 00:44:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:09,262 INFO L225 Difference]: With dead ends: 140 [2019-11-16 00:44:09,262 INFO L226 Difference]: Without dead ends: 140 [2019-11-16 00:44:09,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:44:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-16 00:44:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2019-11-16 00:44:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:44:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2019-11-16 00:44:09,278 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 31 [2019-11-16 00:44:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:09,279 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2019-11-16 00:44:09,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:44:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2019-11-16 00:44:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:44:09,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:09,281 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] [2019-11-16 00:44:09,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:09,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -955558120, now seen corresponding path program 1 times [2019-11-16 00:44:09,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:09,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030510537] [2019-11-16 00:44:09,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:09,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:09,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:09,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030510537] [2019-11-16 00:44:09,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264335109] [2019-11-16 00:44:09,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:44:09,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:09,869 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-16 00:44:09,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:09,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:09,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:09,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:44:10,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:10,047 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 19 treesize of output 33 [2019-11-16 00:44:10,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:10,067 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:44:10,068 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-16 00:44:10,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-16 00:44:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:44:10,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:10,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:44:10,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067538482] [2019-11-16 00:44:10,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:44:10,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:10,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:44:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:44:10,090 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 16 states. [2019-11-16 00:44:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:11,093 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2019-11-16 00:44:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:44:11,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-16 00:44:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:11,095 INFO L225 Difference]: With dead ends: 139 [2019-11-16 00:44:11,095 INFO L226 Difference]: Without dead ends: 139 [2019-11-16 00:44:11,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:44:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-16 00:44:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2019-11-16 00:44:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-16 00:44:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2019-11-16 00:44:11,108 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 31 [2019-11-16 00:44:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:11,108 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2019-11-16 00:44:11,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:44:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2019-11-16 00:44:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:44:11,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:11,112 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:11,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:11,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1532594464, now seen corresponding path program 1 times [2019-11-16 00:44:11,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:11,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422150176] [2019-11-16 00:44:11,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:11,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:11,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:44:12,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422150176] [2019-11-16 00:44:12,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782314421] [2019-11-16 00:44:12,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:12,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:44:12,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:12,333 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-16 00:44:12,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:44:12,351 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-16 00:44:12,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,357 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-16 00:44:12,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:44:12,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:12,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:12,472 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:44:12,472 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-16 00:44:12,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,486 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-16 00:44:12,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-16 00:44:12,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:12,602 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-16 00:44:12,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,609 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-16 00:44:12,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:12,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:12,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:12,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,642 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-16 00:44:12,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:12,670 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-16 00:44:12,671 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-16 00:44:12,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-16 00:44:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:44:12,712 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:12,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-16 00:44:12,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268465907] [2019-11-16 00:44:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:44:12,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:44:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:44:12,714 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 22 states. [2019-11-16 00:44:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:14,208 INFO L93 Difference]: Finished difference Result 224 states and 242 transitions. [2019-11-16 00:44:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:44:14,208 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-16 00:44:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:14,210 INFO L225 Difference]: With dead ends: 224 [2019-11-16 00:44:14,210 INFO L226 Difference]: Without dead ends: 224 [2019-11-16 00:44:14,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:44:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-16 00:44:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2019-11-16 00:44:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-16 00:44:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2019-11-16 00:44:14,220 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 47 [2019-11-16 00:44:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:14,220 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2019-11-16 00:44:14,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:44:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2019-11-16 00:44:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:44:14,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:14,223 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:14,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:14,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1532594463, now seen corresponding path program 1 times [2019-11-16 00:44:14,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366927046] [2019-11-16 00:44:14,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:44:14,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366927046] [2019-11-16 00:44:14,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973429794] [2019-11-16 00:44:14,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,114 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-16 00:44:15,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:44:15,143 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-16 00:44:15,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,150 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-16 00:44:15,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:44:15,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,275 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:44:15,276 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-16 00:44:15,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,307 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-16 00:44:15,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-16 00:44:15,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,448 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-16 00:44:15,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,458 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-16 00:44:15,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:15,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,507 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-16 00:44:15,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,558 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-16 00:44:15,559 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-16 00:44:15,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-16 00:44:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:44:15,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:15,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:44:15,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849105983] [2019-11-16 00:44:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:44:15,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:44:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:44:15,630 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand 18 states. [2019-11-16 00:44:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:16,863 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2019-11-16 00:44:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:44:16,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-16 00:44:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:16,867 INFO L225 Difference]: With dead ends: 234 [2019-11-16 00:44:16,867 INFO L226 Difference]: Without dead ends: 234 [2019-11-16 00:44:16,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:44:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-16 00:44:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 153. [2019-11-16 00:44:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:44:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 180 transitions. [2019-11-16 00:44:16,877 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 180 transitions. Word has length 47 [2019-11-16 00:44:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:16,877 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 180 transitions. [2019-11-16 00:44:16,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:44:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 180 transitions. [2019-11-16 00:44:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:44:16,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:16,879 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:17,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:17,092 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash 350502657, now seen corresponding path program 1 times [2019-11-16 00:44:17,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:17,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250903938] [2019-11-16 00:44:17,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:17,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:44:17,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250903938] [2019-11-16 00:44:17,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:17,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:17,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096058735] [2019-11-16 00:44:17,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:17,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:17,233 INFO L87 Difference]: Start difference. First operand 153 states and 180 transitions. Second operand 8 states. [2019-11-16 00:44:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:17,726 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2019-11-16 00:44:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:17,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-16 00:44:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:17,728 INFO L225 Difference]: With dead ends: 170 [2019-11-16 00:44:17,728 INFO L226 Difference]: Without dead ends: 170 [2019-11-16 00:44:17,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:44:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-16 00:44:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2019-11-16 00:44:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:44:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2019-11-16 00:44:17,735 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 49 [2019-11-16 00:44:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:17,739 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2019-11-16 00:44:17,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2019-11-16 00:44:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:44:17,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:17,747 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:17,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 350502658, now seen corresponding path program 1 times [2019-11-16 00:44:17,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:17,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560980238] [2019-11-16 00:44:17,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:17,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:17,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:44:17,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560980238] [2019-11-16 00:44:17,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:17,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:17,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466021159] [2019-11-16 00:44:17,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:17,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:17,919 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand 8 states. [2019-11-16 00:44:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:18,362 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2019-11-16 00:44:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:18,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-16 00:44:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:18,364 INFO L225 Difference]: With dead ends: 168 [2019-11-16 00:44:18,364 INFO L226 Difference]: Without dead ends: 168 [2019-11-16 00:44:18,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-16 00:44:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-16 00:44:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2019-11-16 00:44:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:44:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-11-16 00:44:18,371 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 49 [2019-11-16 00:44:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:18,371 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-11-16 00:44:18,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-11-16 00:44:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:44:18,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:18,372 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:18,373 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:44:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1825850726, now seen corresponding path program 1 times [2019-11-16 00:44:18,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:18,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931553989] [2019-11-16 00:44:18,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:44:19,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931553989] [2019-11-16 00:44:19,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351013125] [2019-11-16 00:44:19,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:44:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:44:19,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:19,446 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-16 00:44:19,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:19,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:19,453 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-16 00:44:19,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:19,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-16 00:44:27,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:44:27,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,280 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-16 00:44:27,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:27,302 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:44:27,303 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 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:44:27,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:27,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:30 [2019-11-16 00:44:28,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:28,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:44:28,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:28,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:28,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:28,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2019-11-16 00:44:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:44:29,012 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:29,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2019-11-16 00:44:29,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876999411] [2019-11-16 00:44:29,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:44:29,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:44:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=843, Unknown=5, NotChecked=0, Total=930 [2019-11-16 00:44:29,014 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 31 states. [2019-11-16 00:44:39,648 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-16 00:44:55,326 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-16 00:44:57,279 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-16 00:45:02,388 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-16 00:45:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:17,131 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2019-11-16 00:45:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:45:17,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2019-11-16 00:45:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:17,133 INFO L225 Difference]: With dead ends: 173 [2019-11-16 00:45:17,133 INFO L226 Difference]: Without dead ends: 173 [2019-11-16 00:45:17,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=215, Invalid=1934, Unknown=13, NotChecked=0, Total=2162 [2019-11-16 00:45:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-16 00:45:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2019-11-16 00:45:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:45:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-11-16 00:45:17,140 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 51 [2019-11-16 00:45:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:17,141 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-11-16 00:45:17,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:45:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-11-16 00:45:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:45:17,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:17,142 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:17,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:17,343 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:45:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1825850727, now seen corresponding path program 1 times [2019-11-16 00:45:17,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:45:17,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637772926] [2019-11-16 00:45:17,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:17,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:17,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:45:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:45:18,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637772926] [2019-11-16 00:45:18,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241973961] [2019-11-16 00:45:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:45:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:18,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-16 00:45:18,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:18,517 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-16 00:45:18,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:18,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:18,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:18,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:45:18,834 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-16 00:45:18,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:18,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:18,848 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-16 00:45:18,852 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-16 00:45:18,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:18,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:18,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:18,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:10 [2019-11-16 00:45:32,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:32,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:45:32,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:33,010 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.0 percent of original size [2019-11-16 00:45:33,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,020 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 32 treesize of output 20 [2019-11-16 00:45:33,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:33,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:33,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,045 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 30 treesize of output 18 [2019-11-16 00:45:33,046 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:33,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:33,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:33,061 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:44 [2019-11-16 00:45:33,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:45:33,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:33,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:33,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:33,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:45:33,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:33,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:33,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:33,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:14 [2019-11-16 00:45:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:45:33,188 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:45:33,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2019-11-16 00:45:33,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296589626] [2019-11-16 00:45:33,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:45:33,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:45:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:45:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=896, Unknown=7, NotChecked=0, Total=992 [2019-11-16 00:45:33,191 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 32 states. [2019-11-16 00:45:43,825 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-11-16 00:46:00,658 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-11-16 00:46:02,958 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:46:05,169 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:46:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:46:06,486 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2019-11-16 00:46:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:46:06,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-11-16 00:46:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:46:06,489 INFO L225 Difference]: With dead ends: 190 [2019-11-16 00:46:06,489 INFO L226 Difference]: Without dead ends: 190 [2019-11-16 00:46:06,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=200, Invalid=1769, Unknown=11, NotChecked=0, Total=1980 [2019-11-16 00:46:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-16 00:46:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2019-11-16 00:46:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-16 00:46:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-11-16 00:46:06,497 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 51 [2019-11-16 00:46:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:46:06,497 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-11-16 00:46:06,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:46:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-11-16 00:46:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:46:06,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:46:06,499 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:46:06,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:46:06,703 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:46:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:46:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1026647755, now seen corresponding path program 1 times [2019-11-16 00:46:06,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:46:06,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888286696] [2019-11-16 00:46:06,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:06,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:06,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:46:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:46:06,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888286696] [2019-11-16 00:46:06,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:46:06,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:46:06,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903949532] [2019-11-16 00:46:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:46:06,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:46:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:46:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:46:06,984 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 13 states. [2019-11-16 00:46:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:46:07,808 INFO L93 Difference]: Finished difference Result 211 states and 243 transitions. [2019-11-16 00:46:07,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:46:07,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-16 00:46:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:46:07,810 INFO L225 Difference]: With dead ends: 211 [2019-11-16 00:46:07,810 INFO L226 Difference]: Without dead ends: 211 [2019-11-16 00:46:07,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:46:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-16 00:46:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 166. [2019-11-16 00:46:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:46:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2019-11-16 00:46:07,818 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 55 [2019-11-16 00:46:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:46:07,819 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2019-11-16 00:46:07,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:46:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2019-11-16 00:46:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:46:07,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:46:07,821 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:46:07,821 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:46:07,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:46:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1026647754, now seen corresponding path program 1 times [2019-11-16 00:46:07,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:46:07,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080647169] [2019-11-16 00:46:07,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:07,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:07,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:46:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:46:08,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080647169] [2019-11-16 00:46:08,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:46:08,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:46:08,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432614002] [2019-11-16 00:46:08,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:46:08,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:46:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:46:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:46:08,053 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand 13 states. [2019-11-16 00:46:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:46:09,049 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2019-11-16 00:46:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:46:09,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-16 00:46:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:46:09,051 INFO L225 Difference]: With dead ends: 216 [2019-11-16 00:46:09,051 INFO L226 Difference]: Without dead ends: 216 [2019-11-16 00:46:09,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:46:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-16 00:46:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2019-11-16 00:46:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-16 00:46:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2019-11-16 00:46:09,059 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 55 [2019-11-16 00:46:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:46:09,064 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2019-11-16 00:46:09,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:46:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2019-11-16 00:46:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:46:09,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:46:09,065 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:46:09,066 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:46:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:46:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -447593694, now seen corresponding path program 1 times [2019-11-16 00:46:09,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:46:09,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431201398] [2019-11-16 00:46:09,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:09,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:09,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:46:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:10,560 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:46:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:46:10,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431201398] [2019-11-16 00:46:10,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946623360] [2019-11-16 00:46:10,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:46:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 126 conjunts are in the unsatisfiable core [2019-11-16 00:46:10,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:46:11,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:46:11,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,364 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-16 00:46:11,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-16 00:46:11,526 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 11 treesize of output 7 [2019-11-16 00:46:11,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,554 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 11 treesize of output 7 [2019-11-16 00:46:11,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-16 00:46:11,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:11,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2019-11-16 00:46:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:11,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,769 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-16 00:46:11,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:11,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:11,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2019-11-16 00:46:12,393 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 27 treesize of output 7 [2019-11-16 00:46:12,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:12,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:12,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:12,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 112 [2019-11-16 00:46:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:12,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:12,450 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:12,496 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-16 00:46:12,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:12,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:12,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:12,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-11-16 00:46:12,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:12,515 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:12,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:12,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:12,530 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:173, output treesize:10 [2019-11-16 00:46:15,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:15,058 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 38 treesize of output 149 [2019-11-16 00:46:15,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:15,165 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:46:15,165 INFO L567 ElimStorePlain]: treesize reduction 76, result has 76.1 percent of original size [2019-11-16 00:46:15,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:15,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:15,256 INFO L341 Elim1Store]: treesize reduction 33, result has 72.0 percent of original size [2019-11-16 00:46:15,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 202 [2019-11-16 00:46:15,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:15,371 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-16 00:46:15,371 INFO L567 ElimStorePlain]: treesize reduction 225, result has 50.2 percent of original size [2019-11-16 00:46:15,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:15,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:15,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:15,576 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-16 00:46:15,577 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:46:15,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 234 [2019-11-16 00:46:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:15,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:15,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:15,587 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-16 00:46:15,700 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-11-16 00:46:15,701 INFO L567 ElimStorePlain]: treesize reduction 198, result has 45.8 percent of original size [2019-11-16 00:46:15,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:15,702 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:224, output treesize:212 [2019-11-16 00:46:16,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:16,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 196 treesize of output 193 [2019-11-16 00:46:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,420 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-16 00:46:16,561 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-11-16 00:46:16,562 INFO L567 ElimStorePlain]: treesize reduction 97, result has 58.0 percent of original size [2019-11-16 00:46:16,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:16,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:251, output treesize:131 [2019-11-16 00:46:16,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:16,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:16,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:16,910 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 86 [2019-11-16 00:46:16,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:16,918 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-16 00:46:16,991 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-16 00:46:16,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:16,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:118, output treesize:28 [2019-11-16 00:46:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:46:17,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:46:17,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 61 [2019-11-16 00:46:17,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100382734] [2019-11-16 00:46:17,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-16 00:46:17,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:46:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-16 00:46:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3562, Unknown=1, NotChecked=0, Total=3782 [2019-11-16 00:46:17,230 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand 62 states. [2019-11-16 00:46:17,564 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:46:28,085 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-11-16 00:46:30,270 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-16 00:46:31,268 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-16 00:46:34,106 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-16 00:46:34,471 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-16 00:46:36,941 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 110 [2019-11-16 00:46:37,284 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-16 00:46:39,919 WARN L191 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 145 DAG size of output: 132 [2019-11-16 00:46:40,460 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 113 [2019-11-16 00:46:40,874 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-16 00:46:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:46:42,564 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-11-16 00:46:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:46:42,565 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 56 [2019-11-16 00:46:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:46:42,566 INFO L225 Difference]: With dead ends: 199 [2019-11-16 00:46:42,566 INFO L226 Difference]: Without dead ends: 199 [2019-11-16 00:46:42,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=497, Invalid=6640, Unknown=3, NotChecked=0, Total=7140 [2019-11-16 00:46:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-16 00:46:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 171. [2019-11-16 00:46:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:46:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2019-11-16 00:46:42,575 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 56 [2019-11-16 00:46:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:46:42,575 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2019-11-16 00:46:42,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-16 00:46:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2019-11-16 00:46:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:46:42,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:46:42,576 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:46:42,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:46:42,780 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:46:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:46:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash -447593693, now seen corresponding path program 1 times [2019-11-16 00:46:42,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:46:42,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210763664] [2019-11-16 00:46:42,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:42,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:46:42,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:46:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:45,007 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:46:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:46:45,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210763664] [2019-11-16 00:46:45,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604229377] [2019-11-16 00:46:45,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:46:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:45,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 137 conjunts are in the unsatisfiable core [2019-11-16 00:46:45,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:46:45,287 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-16 00:46:45,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:46:45,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:45,726 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-16 00:46:45,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,752 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-16 00:46:45,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-11-16 00:46:45,937 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 11 treesize of output 7 [2019-11-16 00:46:45,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,957 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 11 treesize of output 7 [2019-11-16 00:46:45,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:45,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-16 00:46:46,182 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 27 treesize of output 22 [2019-11-16 00:46:46,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:46,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:46,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:46,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-16 00:46:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:46,225 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:46:46,268 INFO L567 ElimStorePlain]: treesize reduction 45, result has 58.7 percent of original size [2019-11-16 00:46:46,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:46,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-11-16 00:46:47,041 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-16 00:46:47,051 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-16 00:46:47,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:47,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:47,089 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 27 treesize of output 7 [2019-11-16 00:46:47,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:47,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:47,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:47,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:47,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2019-11-16 00:46:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:47,143 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-16 00:46:47,199 INFO L567 ElimStorePlain]: treesize reduction 20, result has 75.0 percent of original size [2019-11-16 00:46:47,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:47,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-16 00:46:47,211 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:47,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:47,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:47,225 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:13 [2019-11-16 00:46:53,696 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_36|], 3=[|v_old(#length)_AFTER_CALL_28|]} [2019-11-16 00:46:53,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:53,716 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-16 00:46:53,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:53,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:53,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:53,791 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 33 treesize of output 88 [2019-11-16 00:46:53,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:53,890 INFO L567 ElimStorePlain]: treesize reduction 50, result has 78.9 percent of original size [2019-11-16 00:46:53,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:53,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:53,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:54,061 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-16 00:46:54,061 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:46:54,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 200 [2019-11-16 00:46:54,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,082 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-16 00:46:54,317 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-11-16 00:46:54,317 INFO L567 ElimStorePlain]: treesize reduction 121, result has 56.3 percent of original size [2019-11-16 00:46:54,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:54,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:54,430 INFO L341 Elim1Store]: treesize reduction 33, result has 67.6 percent of original size [2019-11-16 00:46:54,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 120 [2019-11-16 00:46:54,431 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:54,552 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-16 00:46:54,552 INFO L567 ElimStorePlain]: treesize reduction 47, result has 76.3 percent of original size [2019-11-16 00:46:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:54,556 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:194, output treesize:220 [2019-11-16 00:46:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:54,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:54,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:55,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:55,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:55,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:55,601 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-16 00:46:56,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:56,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:56,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:56,738 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 184 treesize of output 162 [2019-11-16 00:46:56,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,745 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-16 00:46:56,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:56,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 116 [2019-11-16 00:46:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:56,795 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-16 00:46:57,013 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-11-16 00:46:57,014 INFO L567 ElimStorePlain]: treesize reduction 76, result has 68.3 percent of original size [2019-11-16 00:46:57,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:46:57,216 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-16 00:46:57,219 INFO L168 Benchmark]: Toolchain (without parser) took 175695.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -362.2 MB). Peak memory consumption was 553.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:57,220 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:46:57,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:57,220 INFO L168 Benchmark]: Boogie Preprocessor took 61.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:46:57,221 INFO L168 Benchmark]: RCFGBuilder took 1049.31 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: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:57,221 INFO L168 Benchmark]: TraceAbstraction took 174018.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 514.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:57,223 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1049.31 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: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174018.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 514.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-16 00:46:59,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:46:59,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:46:59,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:46:59,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:46:59,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:46:59,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:46:59,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:46:59,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:46:59,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:46:59,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:46:59,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:46:59,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:46:59,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:46:59,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:46:59,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:46:59,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:46:59,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:46:59,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:46:59,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:46:59,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:46:59,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:46:59,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:46:59,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:46:59,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:46:59,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:46:59,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:46:59,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:46:59,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:46:59,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:46:59,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:46:59,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:46:59,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:46:59,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:46:59,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:46:59,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:46:59,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:46:59,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:46:59,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:46:59,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:46:59,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:46:59,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:46:59,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:46:59,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:46:59,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:46:59,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:46:59,790 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:46:59,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:46:59,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:46:59,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:46:59,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:46:59,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:46:59,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:46:59,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:46:59,793 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:46:59,793 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:46:59,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:46:59,793 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:46:59,794 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:46:59,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:46:59,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:46:59,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:46:59,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:46:59,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:46:59,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:46:59,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:46:59,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:46:59,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:46:59,797 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:46:59,797 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:46:59,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:46:59,797 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_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2019-11-16 00:46:59,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:46:59,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:46:59,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:46:59,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:46:59,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:46:59,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:46:59,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/24d35d166/5bd5ea46b5894e4c8159157d7925fe48/FLAG88ee5f111 [2019-11-16 00:47:00,477 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:47:00,478 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:47:00,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/24d35d166/5bd5ea46b5894e4c8159157d7925fe48/FLAG88ee5f111 [2019-11-16 00:47:00,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/bin/uautomizer/data/24d35d166/5bd5ea46b5894e4c8159157d7925fe48 [2019-11-16 00:47:00,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:47:00,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:47:00,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:47:00,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:47:00,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:47:00,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:00" (1/1) ... [2019-11-16 00:47:00,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3030703f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:00, skipping insertion in model container [2019-11-16 00:47:00,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:00" (1/1) ... [2019-11-16 00:47:00,757 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:47:00,803 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:47:01,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:47:01,276 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:47:01,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:47:01,422 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:47:01,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01 WrapperNode [2019-11-16 00:47:01,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:47:01,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:47:01,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:47:01,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:47:01,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... [2019-11-16 00:47:01,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:47:01,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:47:01,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:47:01,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:47:01,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:47:01,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:47:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:47:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:47:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:47:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:47:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:47:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:47:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:47:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2019-11-16 00:47:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:47:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:47:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:47:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:47:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:47:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:47:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:47:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:47:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:47:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:47:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:47:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:47:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:47:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:47:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:47:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:47:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:47:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:47:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:47:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:47:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:47:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:47:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:47:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:47:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:47:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:47:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:47:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:47:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:47:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:47:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:47:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:47:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:47:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:47:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:47:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:47:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:47:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:47:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:47:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:47:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:47:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:47:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:47:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:47:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:47:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:47:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:47:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:47:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:47:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:47:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:47:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:47:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:47:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:47:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:47:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:47:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:47:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:47:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:47:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:47:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:47:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:47:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:47:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:47:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:47:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:47:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:47:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:47:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:47:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:47:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:47:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:47:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:47:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:47:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:47:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:47:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:47:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:47:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:47:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:47:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2019-11-16 00:47:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:47:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:47:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:47:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:47:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:47:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:47:02,018 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:47:02,681 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:47:02,681 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:47:02,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:02 BoogieIcfgContainer [2019-11-16 00:47:02,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:47:02,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:47:02,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:47:02,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:47:02,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:47:00" (1/3) ... [2019-11-16 00:47:02,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d90a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:02, skipping insertion in model container [2019-11-16 00:47:02,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:01" (2/3) ... [2019-11-16 00:47:02,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d90a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:02, skipping insertion in model container [2019-11-16 00:47:02,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:02" (3/3) ... [2019-11-16 00:47:02,690 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2019-11-16 00:47:02,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:47:02,704 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-16 00:47:02,714 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-16 00:47:02,730 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:47:02,730 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:47:02,730 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:47:02,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:47:02,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:47:02,731 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:47:02,731 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:47:02,731 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:47:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-11-16 00:47:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:47:02,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:47:02,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:47:02,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-16 00:47:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:47:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash 823163794, now seen corresponding path program 1 times [2019-11-16 00:47:02,774 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:47:02,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1175958358] [2019-11-16 00:47:02,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa92ecbb-afc0-41a4-8bb3-a853d5fe21f8/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-16 00:47:03,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:47:03,001 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-16 00:47:03,008 INFO L168 Benchmark]: Toolchain (without parser) took 2268.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.3 MB in the beginning and 1.0 GB in the end (delta: -66.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:03,010 INFO L168 Benchmark]: CDTParser took 0.29 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-16 00:47:03,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:03,012 INFO L168 Benchmark]: Boogie Preprocessor took 121.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:47:03,015 INFO L168 Benchmark]: RCFGBuilder took 1129.41 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:03,015 INFO L168 Benchmark]: TraceAbstraction took 321.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:03,028 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 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 684.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1129.41 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 321.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 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...