./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 f6bad48b4609958b21373d95937ae7f736890e97 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:50:46,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:50:46,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:50:46,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:50:46,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:50:46,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:50:46,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:50:46,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:50:46,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:50:46,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:50:46,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:50:46,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:50:46,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:50:46,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:50:46,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:50:46,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:50:46,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:50:46,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:50:46,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:50:46,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:50:46,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:50:46,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:50:46,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:50:46,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:50:46,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:50:46,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:50:46,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:50:46,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:50:46,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:50:46,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:50:46,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:50:46,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:50:46,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:50:46,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:50:46,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:50:46,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:50:46,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:50:46,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:50:46,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:50:46,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:50:46,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:50:46,609 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 20:50:46,633 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:50:46,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:50:46,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:50:46,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:50:46,635 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:50:46,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:50:46,636 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:50:46,636 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 20:50:46,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:50:46,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:50:46,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:50:46,637 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 20:50:46,637 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 20:50:46,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 20:50:46,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:50:46,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 20:50:46,641 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:50:46,642 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:50:46,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:50:46,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:50:46,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:50:46,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:50:46,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:50:46,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:50:46,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:50:46,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:50:46,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:50:46,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:50:46,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_d7c29831-3d24-4e0b-bb72-2a9087998557/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 -> f6bad48b4609958b21373d95937ae7f736890e97 [2020-11-29 20:50:46,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:50:46,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:50:46,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:50:46,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:50:46,987 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:50:46,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2020-11-29 20:50:47,070 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/data/e11b1ae51/4e13e56b9d3d4d8c80954e4e84d04996/FLAG769fcdeac [2020-11-29 20:50:47,706 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:50:47,707 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2020-11-29 20:50:47,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/data/e11b1ae51/4e13e56b9d3d4d8c80954e4e84d04996/FLAG769fcdeac [2020-11-29 20:50:47,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/data/e11b1ae51/4e13e56b9d3d4d8c80954e4e84d04996 [2020-11-29 20:50:47,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:50:47,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 20:50:47,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:50:47,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:50:47,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:50:47,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:50:47" (1/1) ... [2020-11-29 20:50:47,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5ef091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:47, skipping insertion in model container [2020-11-29 20:50:47,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:50:47" (1/1) ... [2020-11-29 20:50:47,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:50:48,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:50:48,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:50:48,450 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:50:48,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:50:48,593 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:50:48,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48 WrapperNode [2020-11-29 20:50:48,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:50:48,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:50:48,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:50:48,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:50:48,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... [2020-11-29 20:50:48,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:50:48,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:50:48,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:50:48,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:50:48,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:50:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 20:50:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:50:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 20:50:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-29 20:50:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-29 20:50:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-29 20:50:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-11-29 20:50:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2020-11-29 20:50:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2020-11-29 20:50:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2020-11-29 20:50:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2020-11-29 20:50:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 20:50:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 20:50:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 20:50:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-29 20:50:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-29 20:50:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 20:50:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:50:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-29 20:50:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-29 20:50:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-29 20:50:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-29 20:50:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-29 20:50:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-29 20:50:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-29 20:50:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-29 20:50:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-29 20:50:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-29 20:50:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-29 20:50:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-29 20:50:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-29 20:50:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-29 20:50:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-29 20:50:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-29 20:50:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-29 20:50:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-29 20:50:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-29 20:50:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-29 20:50:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-29 20:50:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-29 20:50:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-29 20:50:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-29 20:50:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-29 20:50:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-29 20:50:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-29 20:50:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-29 20:50:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-29 20:50:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-29 20:50:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-29 20:50:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-29 20:50:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-29 20:50:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-29 20:50:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-29 20:50:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-29 20:50:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-29 20:50:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-29 20:50:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-29 20:50:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-29 20:50:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-29 20:50:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-29 20:50:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-29 20:50:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-11-29 20:50:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 20:50:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 20:50:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 20:50:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2020-11-29 20:50:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2020-11-29 20:50:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 20:50:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 20:50:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2020-11-29 20:50:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 20:50:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2020-11-29 20:50:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 20:50:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 20:50:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:50:48,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:50:49,230 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-29 20:50:49,599 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:50:49,599 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 20:50:49,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:50:49 BoogieIcfgContainer [2020-11-29 20:50:49,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:50:49,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:50:49,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:50:49,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:50:49,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:50:47" (1/3) ... [2020-11-29 20:50:49,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f6108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:50:49, skipping insertion in model container [2020-11-29 20:50:49,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:50:48" (2/3) ... [2020-11-29 20:50:49,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f6108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:50:49, skipping insertion in model container [2020-11-29 20:50:49,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:50:49" (3/3) ... [2020-11-29 20:50:49,615 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2020-11-29 20:50:49,626 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:50:49,630 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-11-29 20:50:49,641 INFO L253 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-11-29 20:50:49,672 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:50:49,672 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 20:50:49,672 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:50:49,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:50:49,673 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:50:49,673 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:50:49,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:50:49,674 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:50:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2020-11-29 20:50:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:50:49,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:49,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:49,701 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash -449006781, now seen corresponding path program 1 times [2020-11-29 20:50:49,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:49,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663589169] [2020-11-29 20:50:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:49,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:50:49,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663589169] [2020-11-29 20:50:49,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:49,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:50:49,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713358569] [2020-11-29 20:50:50,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:50:50,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:50:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:50:50,015 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2020-11-29 20:50:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:50,435 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2020-11-29 20:50:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:50:50,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 20:50:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:50,452 INFO L225 Difference]: With dead ends: 123 [2020-11-29 20:50:50,453 INFO L226 Difference]: Without dead ends: 117 [2020-11-29 20:50:50,456 INFO L677 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 [2020-11-29 20:50:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-29 20:50:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2020-11-29 20:50:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-29 20:50:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2020-11-29 20:50:50,518 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 12 [2020-11-29 20:50:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:50,519 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2020-11-29 20:50:50,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:50:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2020-11-29 20:50:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:50:50,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:50,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:50,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:50:50,521 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash -449006780, now seen corresponding path program 1 times [2020-11-29 20:50:50,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:50,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237109983] [2020-11-29 20:50:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:50,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:50:50,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237109983] [2020-11-29 20:50:50,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:50,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:50:50,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632502585] [2020-11-29 20:50:50,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:50:50,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:50:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:50:50,657 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 4 states. [2020-11-29 20:50:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:51,002 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2020-11-29 20:50:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:50:51,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 20:50:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:51,005 INFO L225 Difference]: With dead ends: 115 [2020-11-29 20:50:51,005 INFO L226 Difference]: Without dead ends: 115 [2020-11-29 20:50:51,006 INFO L677 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 [2020-11-29 20:50:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-29 20:50:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2020-11-29 20:50:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 20:50:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2020-11-29 20:50:51,028 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 12 [2020-11-29 20:50:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:51,028 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2020-11-29 20:50:51,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:50:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-11-29 20:50:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 20:50:51,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:51,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:51,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:50:51,033 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 54482249, now seen corresponding path program 1 times [2020-11-29 20:50:51,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:51,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426138124] [2020-11-29 20:50:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:51,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:51,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 20:50:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:50:51,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426138124] [2020-11-29 20:50:51,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:51,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:50:51,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932035207] [2020-11-29 20:50:51,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:50:51,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:50:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:50:51,248 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 7 states. [2020-11-29 20:50:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:51,882 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2020-11-29 20:50:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:50:51,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-29 20:50:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:51,885 INFO L225 Difference]: With dead ends: 122 [2020-11-29 20:50:51,885 INFO L226 Difference]: Without dead ends: 122 [2020-11-29 20:50:51,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:50:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-29 20:50:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2020-11-29 20:50:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-29 20:50:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2020-11-29 20:50:51,906 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 19 [2020-11-29 20:50:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:51,906 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2020-11-29 20:50:51,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:50:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2020-11-29 20:50:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 20:50:51,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:51,912 INFO L422 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] [2020-11-29 20:50:51,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:50:51,913 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash -935192171, now seen corresponding path program 1 times [2020-11-29 20:50:51,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:51,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041937905] [2020-11-29 20:50:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 20:50:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 20:50:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:50:52,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041937905] [2020-11-29 20:50:52,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:52,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:50:52,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300088044] [2020-11-29 20:50:52,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:50:52,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:50:52,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:50:52,144 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 8 states. [2020-11-29 20:50:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:52,665 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2020-11-29 20:50:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:50:52,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-29 20:50:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:52,668 INFO L225 Difference]: With dead ends: 116 [2020-11-29 20:50:52,668 INFO L226 Difference]: Without dead ends: 116 [2020-11-29 20:50:52,668 INFO L677 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 [2020-11-29 20:50:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-29 20:50:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2020-11-29 20:50:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 20:50:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2020-11-29 20:50:52,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 28 [2020-11-29 20:50:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:52,678 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2020-11-29 20:50:52,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:50:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-11-29 20:50:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 20:50:52,679 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:52,679 INFO L422 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] [2020-11-29 20:50:52,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:50:52,680 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -935192170, now seen corresponding path program 1 times [2020-11-29 20:50:52,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:52,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84589573] [2020-11-29 20:50:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 20:50:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 20:50:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:50:52,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84589573] [2020-11-29 20:50:52,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:52,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:50:52,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747627058] [2020-11-29 20:50:52,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:50:52,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:50:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:50:52,855 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 8 states. [2020-11-29 20:50:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:53,430 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-11-29 20:50:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:50:53,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-29 20:50:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:53,432 INFO L225 Difference]: With dead ends: 115 [2020-11-29 20:50:53,433 INFO L226 Difference]: Without dead ends: 115 [2020-11-29 20:50:53,433 INFO L677 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 [2020-11-29 20:50:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-29 20:50:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2020-11-29 20:50:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 20:50:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-11-29 20:50:53,442 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 28 [2020-11-29 20:50:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:53,443 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-11-29 20:50:53,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:50:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-11-29 20:50:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-29 20:50:53,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:53,444 INFO L422 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] [2020-11-29 20:50:53,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:50:53,445 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1143009751, now seen corresponding path program 1 times [2020-11-29 20:50:53,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:53,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041040951] [2020-11-29 20:50:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:53,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:53,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 20:50:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:53,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 20:50:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:50:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041040951] [2020-11-29 20:50:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266988324] [2020-11-29 20:50:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:50:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:53,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2020-11-29 20:50:53,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:50:54,067 INFO L384 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 [2020-11-29 20:50:54,068 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:50:54,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:50:54,111 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:50:54,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-29 20:50:54,261 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:50:54,274 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:50:54,275 INFO L384 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 [2020-11-29 20:50:54,275 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:50:54,293 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-29 20:50:54,295 INFO L545 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. [2020-11-29 20:50:54,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2020-11-29 20:50:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:50:54,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:50:54,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2020-11-29 20:50:54,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602070569] [2020-11-29 20:50:54,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 20:50:54,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:50:54,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:50:54,307 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 13 states. [2020-11-29 20:50:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:55,101 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2020-11-29 20:50:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:50:55,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-11-29 20:50:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:55,103 INFO L225 Difference]: With dead ends: 129 [2020-11-29 20:50:55,103 INFO L226 Difference]: Without dead ends: 129 [2020-11-29 20:50:55,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:50:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-29 20:50:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2020-11-29 20:50:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-29 20:50:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2020-11-29 20:50:55,119 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 31 [2020-11-29 20:50:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:55,119 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2020-11-29 20:50:55,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 20:50:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2020-11-29 20:50:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-29 20:50:55,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:55,120 INFO L422 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] [2020-11-29 20:50:55,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-29 20:50:55,354 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1143009752, now seen corresponding path program 1 times [2020-11-29 20:50:55,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:55,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876472752] [2020-11-29 20:50:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:55,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:55,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 20:50:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:55,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 20:50:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:50:55,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876472752] [2020-11-29 20:50:55,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990159001] [2020-11-29 20:50:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:50:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-29 20:50:55,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:50:55,885 INFO L384 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 [2020-11-29 20:50:55,885 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:50:55,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:50:55,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:50:55,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-29 20:50:56,052 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:50:56,052 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-29 20:50:56,053 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:50:56,075 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-29 20:50:56,076 INFO L545 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. [2020-11-29 20:50:56,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-11-29 20:50:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:50:56,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:50:56,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2020-11-29 20:50:56,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990317267] [2020-11-29 20:50:56,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 20:50:56,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:50:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:50:56,086 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 13 states. [2020-11-29 20:50:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:56,968 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2020-11-29 20:50:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:50:56,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-11-29 20:50:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:56,970 INFO L225 Difference]: With dead ends: 114 [2020-11-29 20:50:56,970 INFO L226 Difference]: Without dead ends: 114 [2020-11-29 20:50:56,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:50:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-29 20:50:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2020-11-29 20:50:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 20:50:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-11-29 20:50:56,978 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 31 [2020-11-29 20:50:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:56,983 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-11-29 20:50:56,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 20:50:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-11-29 20:50:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 20:50:56,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:56,987 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:57,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:50:57,206 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 812994153, now seen corresponding path program 1 times [2020-11-29 20:50:57,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:57,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390781295] [2020-11-29 20:50:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:57,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:57,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:50:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:57,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:50:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:57,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:50:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:50:57,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390781295] [2020-11-29 20:50:57,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:57,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 20:50:57,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519098504] [2020-11-29 20:50:57,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 20:50:57,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:57,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 20:50:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:50:57,510 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 14 states. [2020-11-29 20:50:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:58,603 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2020-11-29 20:50:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 20:50:58,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-29 20:50:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:58,605 INFO L225 Difference]: With dead ends: 121 [2020-11-29 20:50:58,605 INFO L226 Difference]: Without dead ends: 121 [2020-11-29 20:50:58,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-11-29 20:50:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-29 20:50:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2020-11-29 20:50:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 20:50:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-11-29 20:50:58,612 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 40 [2020-11-29 20:50:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:58,612 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-11-29 20:50:58,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 20:50:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-11-29 20:50:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 20:50:58,613 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:58,613 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:58,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:50:58,614 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 812994154, now seen corresponding path program 1 times [2020-11-29 20:50:58,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:58,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904193881] [2020-11-29 20:50:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:58,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:58,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:50:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:58,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:50:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:58,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:50:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 20:50:58,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904193881] [2020-11-29 20:50:58,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:58,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 20:50:58,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687659243] [2020-11-29 20:50:58,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:50:58,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:50:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:50:58,775 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 8 states. [2020-11-29 20:50:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:50:59,508 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2020-11-29 20:50:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:50:59,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-11-29 20:50:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:50:59,512 INFO L225 Difference]: With dead ends: 137 [2020-11-29 20:50:59,512 INFO L226 Difference]: Without dead ends: 137 [2020-11-29 20:50:59,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:50:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-29 20:50:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2020-11-29 20:50:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-29 20:50:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2020-11-29 20:50:59,526 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 40 [2020-11-29 20:50:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:50:59,526 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2020-11-29 20:50:59,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:50:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2020-11-29 20:50:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 20:50:59,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:50:59,530 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:50:59,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:50:59,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:50:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:50:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash 812994209, now seen corresponding path program 1 times [2020-11-29 20:50:59,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:50:59,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215063524] [2020-11-29 20:50:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:50:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:59,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:50:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:59,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:50:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:59,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:50:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:59,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:50:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:50:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:50:59,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215063524] [2020-11-29 20:50:59,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:50:59,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 20:50:59,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76878362] [2020-11-29 20:50:59,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 20:50:59,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:50:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 20:50:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:50:59,988 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 14 states. [2020-11-29 20:51:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:01,303 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-11-29 20:51:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 20:51:01,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-29 20:51:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:01,305 INFO L225 Difference]: With dead ends: 132 [2020-11-29 20:51:01,305 INFO L226 Difference]: Without dead ends: 132 [2020-11-29 20:51:01,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2020-11-29 20:51:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-29 20:51:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2020-11-29 20:51:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-29 20:51:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2020-11-29 20:51:01,312 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 40 [2020-11-29 20:51:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:01,313 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2020-11-29 20:51:01,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 20:51:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2020-11-29 20:51:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 20:51:01,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:01,314 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:01,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:51:01,314 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 589928775, now seen corresponding path program 1 times [2020-11-29 20:51:01,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:01,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87079453] [2020-11-29 20:51:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:01,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:01,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:01,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:01,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:51:01,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87079453] [2020-11-29 20:51:01,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742197208] [2020-11-29 20:51:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:02,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 67 conjunts are in the unsatisfiable core [2020-11-29 20:51:02,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:02,133 INFO L384 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 [2020-11-29 20:51:02,134 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,147 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:51:02,321 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,321 INFO L384 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 [2020-11-29 20:51:02,322 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-29 20:51:02,355 INFO L384 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 [2020-11-29 20:51:02,355 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,360 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-11-29 20:51:02,393 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,393 INFO L384 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 37 treesize of output 51 [2020-11-29 20:51:02,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 20:51:02,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:51:02,398 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,407 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:02,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2020-11-29 20:51:02,731 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-29 20:51:02,732 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:02,738 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:02,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2020-11-29 20:51:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:51:02,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:51:02,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2020-11-29 20:51:02,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412292875] [2020-11-29 20:51:02,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-29 20:51:02,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-29 20:51:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2020-11-29 20:51:02,747 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 32 states. [2020-11-29 20:51:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:04,725 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2020-11-29 20:51:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 20:51:04,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2020-11-29 20:51:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:04,727 INFO L225 Difference]: With dead ends: 157 [2020-11-29 20:51:04,727 INFO L226 Difference]: Without dead ends: 157 [2020-11-29 20:51:04,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=1804, Unknown=0, NotChecked=0, Total=1980 [2020-11-29 20:51:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-29 20:51:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2020-11-29 20:51:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-29 20:51:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2020-11-29 20:51:04,734 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 43 [2020-11-29 20:51:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:04,734 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2020-11-29 20:51:04,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-29 20:51:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2020-11-29 20:51:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 20:51:04,735 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:04,736 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:04,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-29 20:51:04,950 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 589928776, now seen corresponding path program 1 times [2020-11-29 20:51:04,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:04,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271128749] [2020-11-29 20:51:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:05,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:05,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:05,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:05,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:51:05,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271128749] [2020-11-29 20:51:05,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197428830] [2020-11-29 20:51:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:06,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 79 conjunts are in the unsatisfiable core [2020-11-29 20:51:06,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:06,057 INFO L384 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 [2020-11-29 20:51:06,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,071 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:51:06,549 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,550 INFO L384 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 [2020-11-29 20:51:06,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,575 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-11-29 20:51:06,575 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,588 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2020-11-29 20:51:06,755 INFO L384 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 [2020-11-29 20:51:06,756 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,773 INFO L384 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 [2020-11-29 20:51:06,773 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:06,787 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2020-11-29 20:51:06,971 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:06,972 INFO L384 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 62 treesize of output 68 [2020-11-29 20:51:06,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-29 20:51:06,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:51:06,975 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:07,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:07,029 INFO L384 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 49 treesize of output 36 [2020-11-29 20:51:07,030 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:07,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:07,064 INFO L545 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. [2020-11-29 20:51:07,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2020-11-29 20:51:07,794 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:07,794 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2020-11-29 20:51:07,795 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:07,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:07,819 INFO L384 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 40 treesize of output 20 [2020-11-29 20:51:07,821 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:07,836 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:07,837 INFO L545 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. [2020-11-29 20:51:07,837 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:23 [2020-11-29 20:51:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:51:08,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:51:08,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2020-11-29 20:51:08,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249690645] [2020-11-29 20:51:08,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-11-29 20:51:08,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-29 20:51:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1799, Unknown=0, NotChecked=0, Total=1892 [2020-11-29 20:51:08,030 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 44 states. [2020-11-29 20:51:09,530 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2020-11-29 20:51:10,095 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2020-11-29 20:51:10,334 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2020-11-29 20:51:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:12,235 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2020-11-29 20:51:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 20:51:12,235 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2020-11-29 20:51:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:12,237 INFO L225 Difference]: With dead ends: 158 [2020-11-29 20:51:12,237 INFO L226 Difference]: Without dead ends: 158 [2020-11-29 20:51:12,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=235, Invalid=3547, Unknown=0, NotChecked=0, Total=3782 [2020-11-29 20:51:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-29 20:51:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2020-11-29 20:51:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-29 20:51:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2020-11-29 20:51:12,245 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 43 [2020-11-29 20:51:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:12,245 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2020-11-29 20:51:12,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-11-29 20:51:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2020-11-29 20:51:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:51:12,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:12,246 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:12,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:51:12,454 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -436340311, now seen corresponding path program 2 times [2020-11-29 20:51:12,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:12,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660470591] [2020-11-29 20:51:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:12,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:12,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:12,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:12,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 20:51:12,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660470591] [2020-11-29 20:51:12,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:51:12,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 20:51:12,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030889675] [2020-11-29 20:51:12,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:51:12,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:51:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:51:12,578 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 9 states. [2020-11-29 20:51:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:13,180 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2020-11-29 20:51:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:51:13,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-11-29 20:51:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:13,183 INFO L225 Difference]: With dead ends: 143 [2020-11-29 20:51:13,183 INFO L226 Difference]: Without dead ends: 143 [2020-11-29 20:51:13,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:51:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-11-29 20:51:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2020-11-29 20:51:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-29 20:51:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2020-11-29 20:51:13,189 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 46 [2020-11-29 20:51:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:13,189 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2020-11-29 20:51:13,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:51:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2020-11-29 20:51:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 20:51:13,190 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:13,191 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:13,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:51:13,191 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:13,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash 550372815, now seen corresponding path program 1 times [2020-11-29 20:51:13,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:13,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697731442] [2020-11-29 20:51:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:51:13,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697731442] [2020-11-29 20:51:13,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:51:13,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 20:51:13,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424296988] [2020-11-29 20:51:13,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:51:13,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:51:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:51:13,480 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 15 states. [2020-11-29 20:51:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:14,319 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2020-11-29 20:51:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 20:51:14,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2020-11-29 20:51:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:14,322 INFO L225 Difference]: With dead ends: 151 [2020-11-29 20:51:14,322 INFO L226 Difference]: Without dead ends: 151 [2020-11-29 20:51:14,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2020-11-29 20:51:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-29 20:51:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2020-11-29 20:51:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-29 20:51:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2020-11-29 20:51:14,328 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 53 [2020-11-29 20:51:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:14,329 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2020-11-29 20:51:14,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:51:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-11-29 20:51:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 20:51:14,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:14,331 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:14,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:51:14,331 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 550372816, now seen corresponding path program 1 times [2020-11-29 20:51:14,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:14,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197746034] [2020-11-29 20:51:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:51:14,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197746034] [2020-11-29 20:51:14,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287224376] [2020-11-29 20:51:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:14,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 20:51:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:51:14,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:51:14,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2020-11-29 20:51:14,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925016503] [2020-11-29 20:51:14,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:51:14,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:51:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:51:14,778 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 9 states. [2020-11-29 20:51:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:15,284 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2020-11-29 20:51:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:51:15,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-11-29 20:51:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:15,285 INFO L225 Difference]: With dead ends: 154 [2020-11-29 20:51:15,286 INFO L226 Difference]: Without dead ends: 154 [2020-11-29 20:51:15,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:51:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-29 20:51:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 134. [2020-11-29 20:51:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-29 20:51:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2020-11-29 20:51:15,295 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 53 [2020-11-29 20:51:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:15,295 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2020-11-29 20:51:15,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:51:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2020-11-29 20:51:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 20:51:15,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:15,297 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:15,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-29 20:51:15,514 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -649638603, now seen corresponding path program 1 times [2020-11-29 20:51:15,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:15,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382667764] [2020-11-29 20:51:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:51:15,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382667764] [2020-11-29 20:51:15,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859538443] [2020-11-29 20:51:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:15,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:51:15,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:51:15,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:51:15,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 11 [2020-11-29 20:51:15,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021363607] [2020-11-29 20:51:15,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:51:15,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:51:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:51:15,898 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 7 states. [2020-11-29 20:51:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:16,013 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2020-11-29 20:51:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:51:16,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-11-29 20:51:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:16,015 INFO L225 Difference]: With dead ends: 131 [2020-11-29 20:51:16,015 INFO L226 Difference]: Without dead ends: 131 [2020-11-29 20:51:16,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:51:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-29 20:51:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-11-29 20:51:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-29 20:51:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2020-11-29 20:51:16,027 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 54 [2020-11-29 20:51:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:16,028 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2020-11-29 20:51:16,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:51:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2020-11-29 20:51:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-29 20:51:16,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:16,029 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:16,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:51:16,239 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -759043115, now seen corresponding path program 3 times [2020-11-29 20:51:16,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:16,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99225411] [2020-11-29 20:51:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 20:51:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:51:16,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99225411] [2020-11-29 20:51:16,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797065840] [2020-11-29 20:51:16,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:16,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-29 20:51:16,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:51:16,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:51:16,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:51:16,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:51:16,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2020-11-29 20:51:16,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034163200] [2020-11-29 20:51:16,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 20:51:16,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:16,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:51:16,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:51:16,618 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 10 states. [2020-11-29 20:51:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:17,093 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2020-11-29 20:51:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:51:17,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-11-29 20:51:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:17,095 INFO L225 Difference]: With dead ends: 136 [2020-11-29 20:51:17,095 INFO L226 Difference]: Without dead ends: 127 [2020-11-29 20:51:17,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:51:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-29 20:51:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2020-11-29 20:51:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-29 20:51:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2020-11-29 20:51:17,100 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 55 [2020-11-29 20:51:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:17,101 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2020-11-29 20:51:17,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 20:51:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2020-11-29 20:51:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 20:51:17,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:17,102 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:17,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-29 20:51:17,314 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1779817668, now seen corresponding path program 2 times [2020-11-29 20:51:17,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:17,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415774120] [2020-11-29 20:51:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:51:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 20:51:17,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415774120] [2020-11-29 20:51:17,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:51:17,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 20:51:17,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013743481] [2020-11-29 20:51:17,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:51:17,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:51:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:51:17,722 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 15 states. [2020-11-29 20:51:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:18,454 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2020-11-29 20:51:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 20:51:18,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-11-29 20:51:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:18,456 INFO L225 Difference]: With dead ends: 131 [2020-11-29 20:51:18,456 INFO L226 Difference]: Without dead ends: 131 [2020-11-29 20:51:18,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2020-11-29 20:51:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-29 20:51:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2020-11-29 20:51:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-29 20:51:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-11-29 20:51:18,461 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 61 [2020-11-29 20:51:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:18,461 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-11-29 20:51:18,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:51:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-11-29 20:51:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:51:18,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:18,462 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:18,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:51:18,463 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1176997300, now seen corresponding path program 1 times [2020-11-29 20:51:18,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:18,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704456676] [2020-11-29 20:51:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:51:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 20:51:18,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704456676] [2020-11-29 20:51:18,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:51:18,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 20:51:18,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32584981] [2020-11-29 20:51:18,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 20:51:18,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:51:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:51:18,646 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 10 states. [2020-11-29 20:51:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:19,167 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2020-11-29 20:51:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:51:19,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2020-11-29 20:51:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:19,168 INFO L225 Difference]: With dead ends: 124 [2020-11-29 20:51:19,168 INFO L226 Difference]: Without dead ends: 124 [2020-11-29 20:51:19,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:51:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-29 20:51:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-11-29 20:51:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-29 20:51:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2020-11-29 20:51:19,172 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 64 [2020-11-29 20:51:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:19,173 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2020-11-29 20:51:19,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 20:51:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2020-11-29 20:51:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:51:19,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:19,174 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:19,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 20:51:19,174 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1176997245, now seen corresponding path program 1 times [2020-11-29 20:51:19,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:19,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018141125] [2020-11-29 20:51:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:19,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:19,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:19,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:19,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:19,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:20,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:51:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:51:20,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018141125] [2020-11-29 20:51:20,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618542712] [2020-11-29 20:51:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/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 [2020-11-29 20:51:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 93 conjunts are in the unsatisfiable core [2020-11-29 20:51:20,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:20,324 INFO L384 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 [2020-11-29 20:51:20,324 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,330 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:51:20,566 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,566 INFO L384 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 [2020-11-29 20:51:20,567 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-29 20:51:20,678 INFO L384 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 [2020-11-29 20:51:20,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,683 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-29 20:51:20,776 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,776 INFO L384 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 28 treesize of output 46 [2020-11-29 20:51:20,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 20:51:20,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:51:20,778 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:20,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:20,783 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:20,783 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-11-29 20:51:21,416 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:51:21,478 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:21,478 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 184 [2020-11-29 20:51:21,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:51:21,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:51:21,482 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:21,528 INFO L625 ElimStorePlain]: treesize reduction 117, result has 27.3 percent of original size [2020-11-29 20:51:21,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:21,530 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:24 [2020-11-29 20:51:21,563 INFO L384 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 18 treesize of output 10 [2020-11-29 20:51:21,564 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:21,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:21,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:21,576 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2020-11-29 20:51:39,707 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-29 20:51:39,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:51:39,745 INFO L384 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 37 treesize of output 17 [2020-11-29 20:51:39,746 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:39,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:39,763 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:39,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:26 [2020-11-29 20:51:39,911 INFO L384 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 25 treesize of output 13 [2020-11-29 20:51:39,911 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:39,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:39,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:39,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2020-11-29 20:51:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:51:39,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:51:39,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 53 [2020-11-29 20:51:39,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248922501] [2020-11-29 20:51:39,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-11-29 20:51:39,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:51:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-11-29 20:51:39,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2700, Unknown=16, NotChecked=0, Total=2862 [2020-11-29 20:51:39,934 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 54 states. [2020-11-29 20:51:45,595 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 52 [2020-11-29 20:51:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:51:47,366 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-11-29 20:51:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-29 20:51:47,366 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 64 [2020-11-29 20:51:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:51:47,367 INFO L225 Difference]: With dead ends: 130 [2020-11-29 20:51:47,367 INFO L226 Difference]: Without dead ends: 130 [2020-11-29 20:51:47,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=434, Invalid=5402, Unknown=16, NotChecked=0, Total=5852 [2020-11-29 20:51:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-29 20:51:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2020-11-29 20:51:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-29 20:51:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2020-11-29 20:51:47,374 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 64 [2020-11-29 20:51:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:51:47,374 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2020-11-29 20:51:47,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-11-29 20:51:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2020-11-29 20:51:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:51:47,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:51:47,376 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:51:47,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:51:47,586 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:51:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:51:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1176997246, now seen corresponding path program 1 times [2020-11-29 20:51:47,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:51:47,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249676020] [2020-11-29 20:51:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:51:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:47,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:51:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:47,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:51:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:48,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:51:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:48,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:51:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:48,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:51:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:48,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:51:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:51:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249676020] [2020-11-29 20:51:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328459442] [2020-11-29 20:51:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:51:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:51:49,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 109 conjunts are in the unsatisfiable core [2020-11-29 20:51:49,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:51:49,296 INFO L384 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 [2020-11-29 20:51:49,297 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:51:49,747 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,747 INFO L384 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 [2020-11-29 20:51:49,748 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,763 INFO L384 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 [2020-11-29 20:51:49,763 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,775 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,775 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2020-11-29 20:51:49,912 INFO L384 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 [2020-11-29 20:51:49,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,929 INFO L384 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 [2020-11-29 20:51:49,929 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:49,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:51:49,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2020-11-29 20:51:50,070 INFO L384 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 [2020-11-29 20:51:50,070 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:50,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,098 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,099 INFO L384 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 [2020-11-29 20:51:50,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-29 20:51:50,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:51:50,101 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:50,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,119 INFO L545 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. [2020-11-29 20:51:50,119 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:55 [2020-11-29 20:51:50,632 INFO L384 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 19 treesize of output 7 [2020-11-29 20:51:50,634 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:50,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,696 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,696 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2020-11-29 20:51:50,698 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:50,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:50,719 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:50,719 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:21 [2020-11-29 20:51:53,193 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:51:53,272 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:53,272 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 154 [2020-11-29 20:51:53,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:51:53,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:51:53,275 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:53,394 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-11-29 20:51:53,394 INFO L625 ElimStorePlain]: treesize reduction 60, result has 67.4 percent of original size [2020-11-29 20:51:53,399 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:51:53,414 INFO L350 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2020-11-29 20:51:53,414 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 34 [2020-11-29 20:51:53,415 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:53,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:53,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:53,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:149, output treesize:99 [2020-11-29 20:51:53,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:53,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:54,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:54,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:51:54,228 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:54,229 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2020-11-29 20:51:54,230 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:54,259 INFO L384 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 18 treesize of output 10 [2020-11-29 20:51:54,260 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:51:54,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:54,338 INFO L384 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 31 treesize of output 15 [2020-11-29 20:51:54,342 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:54,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-11-29 20:51:54,351 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:51:54,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:51:54,402 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-29 20:51:54,402 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:133, output treesize:43 [2020-11-29 20:52:04,498 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 20:52:04,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:04,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:52:04,632 INFO L384 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 37 treesize of output 17 [2020-11-29 20:52:04,633 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:04,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:52:04,697 INFO L350 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2020-11-29 20:52:04,698 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 59 [2020-11-29 20:52:04,698 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:04,813 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-11-29 20:52:04,814 INFO L625 ElimStorePlain]: treesize reduction 121, result has 41.0 percent of original size [2020-11-29 20:52:04,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:52:04,821 INFO L384 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 36 treesize of output 16 [2020-11-29 20:52:04,822 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:04,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:04,862 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 20:52:04,862 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:229, output treesize:62 [2020-11-29 20:52:04,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:04,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:05,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:06,111 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:52:06,112 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 20:52:06,113 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:06,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:06,162 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:52:06,163 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 20:52:06,163 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:06,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:06,188 INFO L545 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. [2020-11-29 20:52:06,189 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:23 [2020-11-29 20:52:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:52:06,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:52:06,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2020-11-29 20:52:06,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55566153] [2020-11-29 20:52:06,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 61 states [2020-11-29 20:52:06,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2020-11-29 20:52:06,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3493, Unknown=4, NotChecked=0, Total=3660 [2020-11-29 20:52:06,453 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 61 states. [2020-11-29 20:52:09,418 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2020-11-29 20:52:10,224 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-11-29 20:52:10,623 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2020-11-29 20:52:15,596 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 60 [2020-11-29 20:52:16,285 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2020-11-29 20:52:16,760 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2020-11-29 20:52:17,071 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2020-11-29 20:52:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:18,940 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2020-11-29 20:52:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-29 20:52:18,942 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64 [2020-11-29 20:52:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:52:18,943 INFO L225 Difference]: With dead ends: 125 [2020-11-29 20:52:18,943 INFO L226 Difference]: Without dead ends: 125 [2020-11-29 20:52:18,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=470, Invalid=7182, Unknown=4, NotChecked=0, Total=7656 [2020-11-29 20:52:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-29 20:52:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2020-11-29 20:52:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-29 20:52:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2020-11-29 20:52:18,952 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 64 [2020-11-29 20:52:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:52:18,952 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2020-11-29 20:52:18,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2020-11-29 20:52:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2020-11-29 20:52:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 20:52:18,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:52:18,953 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:19,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:52:19,154 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:52:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -415139827, now seen corresponding path program 1 times [2020-11-29 20:52:19,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266883137] [2020-11-29 20:52:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:52:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:52:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:52:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:52:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:52:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:52:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:52:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 20:52:19,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266883137] [2020-11-29 20:52:19,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:19,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 20:52:19,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086866257] [2020-11-29 20:52:19,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:52:19,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:52:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:52:19,436 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 9 states. [2020-11-29 20:52:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:20,118 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2020-11-29 20:52:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:52:20,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-11-29 20:52:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:52:20,122 INFO L225 Difference]: With dead ends: 126 [2020-11-29 20:52:20,122 INFO L226 Difference]: Without dead ends: 126 [2020-11-29 20:52:20,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:52:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-29 20:52:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2020-11-29 20:52:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-29 20:52:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2020-11-29 20:52:20,128 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 69 [2020-11-29 20:52:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:52:20,128 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2020-11-29 20:52:20,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:52:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2020-11-29 20:52:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-29 20:52:20,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:52:20,129 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:20,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 20:52:20,130 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:52:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1022384130, now seen corresponding path program 1 times [2020-11-29 20:52:20,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:20,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977937577] [2020-11-29 20:52:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:20,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:52:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:20,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:52:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:20,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:52:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:21,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:52:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:21,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:52:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:52:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:21,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:52:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:52:22,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977937577] [2020-11-29 20:52:22,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488638612] [2020-11-29 20:52:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:52:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:22,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 121 conjunts are in the unsatisfiable core [2020-11-29 20:52:22,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:52:22,485 INFO L384 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 [2020-11-29 20:52:22,485 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:22,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:22,491 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:52:22,491 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:52:23,039 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:23,040 INFO L384 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 [2020-11-29 20:52:23,040 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:23,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:23,047 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:52:23,047 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-29 20:52:23,271 INFO L384 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 [2020-11-29 20:52:23,272 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:23,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:23,283 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:52:23,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-29 20:52:23,474 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:23,474 INFO L384 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 28 treesize of output 46 [2020-11-29 20:52:23,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 20:52:23,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:52:23,475 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:23,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:23,482 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:52:23,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-11-29 20:52:24,486 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.offset_31|]} [2020-11-29 20:52:24,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2020-11-29 20:52:24,508 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:24,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:24,574 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:24,574 INFO L384 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 96 treesize of output 120 [2020-11-29 20:52:24,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 20:52:24,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:52:24,576 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-29 20:52:24,678 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2020-11-29 20:52:24,679 INFO L625 ElimStorePlain]: treesize reduction 64, result has 63.4 percent of original size [2020-11-29 20:52:24,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:52:24,681 INFO L545 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. [2020-11-29 20:52:24,681 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:111 [2020-11-29 20:52:24,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:52:26,702 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_sll_circular_update_at_~head.offset_10 Int)) (and (<= 0 v_sll_circular_update_at_~head.offset_10) (<= v_sll_circular_update_at_~head.offset_10 |c_sll_circular_update_at_#in~head.offset|) (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) v_sll_circular_update_at_~head.offset_10))) (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| .cse2)) (.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse0 (select |c_#memory_int| .cse2))) (or (let ((.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_sll_circular_update_at_~head.offset_10) 4))) (and (= (select .cse0 .cse1) |c_sll_circular_update_at_#in~data|) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse3 .cse1 (select .cse4 .cse1))) |c_#memory_$Pointer$.base|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse3 v_sll_circular_update_at_~head.offset_10 (select .cse4 v_sll_circular_update_at_~head.offset_10)))) (= |c_sll_circular_update_at_#in~data| (select .cse0 v_sll_circular_update_at_~head.offset_10)) (= .cse2 |c_sll_circular_update_at_#in~head.base|))))))) is different from true [2020-11-29 20:52:26,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:52:28,722 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_sll_circular_update_at_~head.offset_10 Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) v_sll_circular_update_at_~head.offset_10))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) v_sll_circular_update_at_~head.offset_10 (select (select |c_#memory_$Pointer$.base| .cse0) v_sll_circular_update_at_~head.offset_10)))) (<= 0 v_sll_circular_update_at_~head.offset_10) (<= v_sll_circular_update_at_~head.offset_10 |c_sll_circular_update_at_#in~head.offset|) (= |c_sll_circular_update_at_#in~data| (select (select |c_#memory_int| .cse0) v_sll_circular_update_at_~head.offset_10)) (= .cse0 |c_sll_circular_update_at_#in~head.base|)))) (exists ((v_sll_circular_update_at_~head.offset_10 Int)) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) v_sll_circular_update_at_~head.offset_10)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_sll_circular_update_at_~head.offset_10) 4))) (and (= (select (select |c_#memory_int| .cse1) .cse2) |c_sll_circular_update_at_#in~data|) (= (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) .cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) |c_#memory_$Pointer$.base|) (<= 0 v_sll_circular_update_at_~head.offset_10) (<= v_sll_circular_update_at_~head.offset_10 |c_sll_circular_update_at_#in~head.offset|))))) is different from true [2020-11-29 20:52:28,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:28,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:52:28,796 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:52:28,904 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 20:52:28,904 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:28,905 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 240 [2020-11-29 20:52:28,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:52:28,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:52:28,907 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:28,987 INFO L625 ElimStorePlain]: treesize reduction 145, result has 29.3 percent of original size [2020-11-29 20:52:28,989 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:52:28,990 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:39 [2020-11-29 20:52:31,255 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) .cse0 sll_circular_update_at_~data))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2020-11-29 20:52:31,289 INFO L384 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 35 treesize of output 34 [2020-11-29 20:52:31,289 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:31,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:31,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:52:31,324 INFO L384 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 49 treesize of output 29 [2020-11-29 20:52:31,324 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:31,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:31,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:52:31,353 INFO L384 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 41 treesize of output 25 [2020-11-29 20:52:31,353 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:31,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:31,372 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:52:31,372 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:93, output treesize:39 [2020-11-29 20:52:37,384 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:52:37,432 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:37,432 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 112 [2020-11-29 20:52:37,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:52:37,576 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-11-29 20:52:37,577 INFO L625 ElimStorePlain]: treesize reduction 56, result has 66.9 percent of original size [2020-11-29 20:52:37,585 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:52:37,592 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:52:37,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2020-11-29 20:52:37,594 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:52:37,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:37,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:52:37,599 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 20:52:37,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:52:37,603 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-11-29 20:52:37,700 INFO L625 ElimStorePlain]: treesize reduction 16, result has 82.0 percent of original size [2020-11-29 20:52:37,701 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-11-29 20:52:37,706 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:52:37,707 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:118, output treesize:22 [2020-11-29 20:52:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2020-11-29 20:52:37,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:52:37,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 72 [2020-11-29 20:52:37,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405078046] [2020-11-29 20:52:37,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 72 states [2020-11-29 20:52:37,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2020-11-29 20:52:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4513, Unknown=5, NotChecked=408, Total=5112 [2020-11-29 20:52:37,957 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 72 states. [2020-11-29 20:52:41,341 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-11-29 20:52:41,609 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-29 20:52:43,917 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 80 [2020-11-29 20:52:46,595 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 20:52:48,768 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-11-29 20:52:59,982 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2020-11-29 20:54:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:54:11,275 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2020-11-29 20:54:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-29 20:54:11,301 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2020-11-29 20:54:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:54:11,302 INFO L225 Difference]: With dead ends: 149 [2020-11-29 20:54:11,302 INFO L226 Difference]: Without dead ends: 145 [2020-11-29 20:54:11,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=575, Invalid=10546, Unknown=21, NotChecked=630, Total=11772 [2020-11-29 20:54:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-29 20:54:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 111. [2020-11-29 20:54:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-29 20:54:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2020-11-29 20:54:11,313 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 72 [2020-11-29 20:54:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:54:11,313 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2020-11-29 20:54:11,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2020-11-29 20:54:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2020-11-29 20:54:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-29 20:54:11,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:54:11,315 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:54:11,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:54:11,528 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:54:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:54:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash -447608557, now seen corresponding path program 1 times [2020-11-29 20:54:11,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:54:11,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374895237] [2020-11-29 20:54:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:54:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:11,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:54:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:11,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:54:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:54:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:54:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:54:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:54:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:54:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:54:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:54:12,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374895237] [2020-11-29 20:54:12,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649620689] [2020-11-29 20:54:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:54:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:12,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 55 conjunts are in the unsatisfiable core [2020-11-29 20:54:12,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:54:13,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 20:54:13,104 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:13,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:13,108 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:54:13,108 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 20:54:14,619 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:14,620 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 56 [2020-11-29 20:54:14,622 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:54:14,623 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:14,706 INFO L625 ElimStorePlain]: treesize reduction 41, result has 42.3 percent of original size [2020-11-29 20:54:14,707 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:54:14,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:82, output treesize:27 [2020-11-29 20:54:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 20:54:14,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:54:14,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 41 [2020-11-29 20:54:14,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523729426] [2020-11-29 20:54:14,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-29 20:54:14,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:54:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-29 20:54:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2020-11-29 20:54:14,884 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 41 states. [2020-11-29 20:54:17,653 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-11-29 20:54:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:54:19,440 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2020-11-29 20:54:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 20:54:19,441 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 83 [2020-11-29 20:54:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:54:19,442 INFO L225 Difference]: With dead ends: 143 [2020-11-29 20:54:19,442 INFO L226 Difference]: Without dead ends: 143 [2020-11-29 20:54:19,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=389, Invalid=3643, Unknown=0, NotChecked=0, Total=4032 [2020-11-29 20:54:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-11-29 20:54:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2020-11-29 20:54:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-29 20:54:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2020-11-29 20:54:19,450 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 83 [2020-11-29 20:54:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:54:19,450 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2020-11-29 20:54:19,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-29 20:54:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2020-11-29 20:54:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 20:54:19,451 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:54:19,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:54:19,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-29 20:54:19,652 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:54:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:54:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1930677960, now seen corresponding path program 2 times [2020-11-29 20:54:19,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:54:19,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836244650] [2020-11-29 20:54:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:54:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:54:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:54:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:54:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:54:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:54:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:54:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:54:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:54:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:54:19,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836244650] [2020-11-29 20:54:19,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431543140] [2020-11-29 20:54:19,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:54:20,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:54:20,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:54:20,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:54:20,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:54:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:54:20,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:54:20,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2020-11-29 20:54:20,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380369861] [2020-11-29 20:54:20,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:54:20,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:54:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:54:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:54:20,286 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 12 states. [2020-11-29 20:54:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:54:21,361 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2020-11-29 20:54:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 20:54:21,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2020-11-29 20:54:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:54:21,364 INFO L225 Difference]: With dead ends: 130 [2020-11-29 20:54:21,364 INFO L226 Difference]: Without dead ends: 123 [2020-11-29 20:54:21,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:54:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-29 20:54:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2020-11-29 20:54:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-29 20:54:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2020-11-29 20:54:21,369 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 86 [2020-11-29 20:54:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:54:21,369 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2020-11-29 20:54:21,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:54:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2020-11-29 20:54:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 20:54:21,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:54:21,370 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:54:21,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-11-29 20:54:21,590 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:54:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:54:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash -839512116, now seen corresponding path program 1 times [2020-11-29 20:54:21,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:54:21,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195773723] [2020-11-29 20:54:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:54:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:54:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:54:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:54:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:54:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:54:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:54:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:54:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:54:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-29 20:54:21,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195773723] [2020-11-29 20:54:21,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:54:21,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 20:54:21,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043693100] [2020-11-29 20:54:21,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 20:54:21,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:54:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:54:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:54:21,820 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 10 states. [2020-11-29 20:54:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:54:22,799 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2020-11-29 20:54:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:54:22,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2020-11-29 20:54:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:54:22,801 INFO L225 Difference]: With dead ends: 124 [2020-11-29 20:54:22,801 INFO L226 Difference]: Without dead ends: 124 [2020-11-29 20:54:22,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:54:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-29 20:54:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2020-11-29 20:54:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-29 20:54:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2020-11-29 20:54:22,806 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 86 [2020-11-29 20:54:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:54:22,806 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2020-11-29 20:54:22,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 20:54:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2020-11-29 20:54:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 20:54:22,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:54:22,807 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:54:22,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 20:54:22,807 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:54:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:54:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash -839512115, now seen corresponding path program 1 times [2020-11-29 20:54:22,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:54:22,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188154624] [2020-11-29 20:54:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:54:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:22,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:54:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:22,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:54:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:54:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:54:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:54:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:54:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:54:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:54:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-29 20:54:23,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188154624] [2020-11-29 20:54:23,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:54:23,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 20:54:23,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513781874] [2020-11-29 20:54:23,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:54:23,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:54:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:54:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:54:23,343 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2020-11-29 20:54:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:54:24,534 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2020-11-29 20:54:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 20:54:24,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2020-11-29 20:54:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:54:24,540 INFO L225 Difference]: With dead ends: 118 [2020-11-29 20:54:24,540 INFO L226 Difference]: Without dead ends: 118 [2020-11-29 20:54:24,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2020-11-29 20:54:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-29 20:54:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2020-11-29 20:54:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-29 20:54:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2020-11-29 20:54:24,545 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 86 [2020-11-29 20:54:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:54:24,545 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2020-11-29 20:54:24,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:54:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2020-11-29 20:54:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 20:54:24,546 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:54:24,547 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:54:24,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 20:54:24,547 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:54:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:54:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash -310807391, now seen corresponding path program 1 times [2020-11-29 20:54:24,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:54:24,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944015715] [2020-11-29 20:54:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:54:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:54:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:54:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:54:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:54:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:54:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:54:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:54:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:54:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 20:54:24,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944015715] [2020-11-29 20:54:24,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316876957] [2020-11-29 20:54:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:54:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:54:25,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 95 conjunts are in the unsatisfiable core [2020-11-29 20:54:25,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:54:25,172 INFO L384 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 [2020-11-29 20:54:25,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:54:25,553 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,553 INFO L384 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 [2020-11-29 20:54:25,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,569 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-29 20:54:25,697 INFO L384 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 [2020-11-29 20:54:25,698 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,711 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-29 20:54:25,852 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,852 INFO L384 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 28 treesize of output 46 [2020-11-29 20:54:25,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 20:54:25,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:54:25,853 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:25,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:25,861 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:54:25,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-11-29 20:54:26,625 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:54:26,789 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 20:54:26,790 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:26,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 184 [2020-11-29 20:54:26,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:54:26,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:54:26,793 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:26,874 INFO L625 ElimStorePlain]: treesize reduction 117, result has 27.3 percent of original size [2020-11-29 20:54:26,877 INFO L545 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. [2020-11-29 20:54:26,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:27 [2020-11-29 20:54:27,011 INFO L384 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 18 treesize of output 10 [2020-11-29 20:54:27,011 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:54:27,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:27,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:54:27,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2020-11-29 20:54:55,418 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-29 20:54:55,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:54:55,432 INFO L384 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 37 treesize of output 17 [2020-11-29 20:54:55,432 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:54:55,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:54:55,453 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:54:55,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:32 [2020-11-29 20:55:04,404 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:55:04,407 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:55:04,407 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2020-11-29 20:55:04,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:55:04,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:55:04,422 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:55:04,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:5 [2020-11-29 20:55:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 20:55:04,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:55:04,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2020-11-29 20:55:04,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155701120] [2020-11-29 20:55:04,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-11-29 20:55:04,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:55:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-29 20:55:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1605, Unknown=16, NotChecked=0, Total=1722 [2020-11-29 20:55:04,461 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 42 states. [2020-11-29 20:55:45,246 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2020-11-29 20:55:51,504 WARN L193 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-29 20:56:00,243 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-11-29 20:56:13,321 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-11-29 20:56:13,629 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-11-29 20:56:13,929 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-11-29 20:56:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:56:23,027 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2020-11-29 20:56:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-29 20:56:23,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2020-11-29 20:56:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:56:23,030 INFO L225 Difference]: With dead ends: 124 [2020-11-29 20:56:23,030 INFO L226 Difference]: Without dead ends: 124 [2020-11-29 20:56:23,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=422, Invalid=4251, Unknown=19, NotChecked=0, Total=4692 [2020-11-29 20:56:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-29 20:56:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-11-29 20:56:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-29 20:56:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2020-11-29 20:56:23,036 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 89 [2020-11-29 20:56:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:56:23,036 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2020-11-29 20:56:23,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-11-29 20:56:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2020-11-29 20:56:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 20:56:23,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:56:23,038 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:56:23,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-11-29 20:56:23,238 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:56:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:56:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -310807390, now seen corresponding path program 1 times [2020-11-29 20:56:23,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:56:23,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859009862] [2020-11-29 20:56:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:56:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:23,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:56:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:23,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:56:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:24,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:56:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:24,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:56:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:24,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:56:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:24,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:56:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:25,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:56:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:25,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:56:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-29 20:56:25,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859009862] [2020-11-29 20:56:25,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233788805] [2020-11-29 20:56:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:56:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:56:25,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 108 conjunts are in the unsatisfiable core [2020-11-29 20:56:25,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:56:25,567 INFO L384 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 [2020-11-29 20:56:25,567 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:25,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:25,575 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:56:25,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:56:26,135 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,135 INFO L384 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 [2020-11-29 20:56:26,136 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-11-29 20:56:26,323 INFO L384 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 [2020-11-29 20:56:26,323 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,357 INFO L384 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 [2020-11-29 20:56:26,357 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,372 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,373 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2020-11-29 20:56:26,567 INFO L384 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 34 treesize of output 25 [2020-11-29 20:56:26,568 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,657 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,657 INFO L384 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 39 treesize of output 53 [2020-11-29 20:56:26,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 20:56:26,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:56:26,659 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:26,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:26,675 INFO L545 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. [2020-11-29 20:56:26,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2020-11-29 20:56:28,159 INFO L441 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_20|]} [2020-11-29 20:56:28,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:56:28,168 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:56:28,192 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:28,192 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 62 [2020-11-29 20:56:28,193 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:28,307 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-11-29 20:56:28,307 INFO L625 ElimStorePlain]: treesize reduction 28, result has 79.3 percent of original size [2020-11-29 20:56:28,312 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:56:28,383 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:28,384 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 143 [2020-11-29 20:56:28,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 20:56:28,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:56:28,386 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:28,485 INFO L625 ElimStorePlain]: treesize reduction 60, result has 57.7 percent of original size [2020-11-29 20:56:28,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,506 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 20:56:28,506 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:132, output treesize:82 [2020-11-29 20:56:28,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:28,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:29,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:29,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:56:29,334 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_BEFORE_CALL_21|], 6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_10|]} [2020-11-29 20:56:29,341 INFO L384 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 18 treesize of output 10 [2020-11-29 20:56:29,342 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:56:29,358 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:29,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 64 [2020-11-29 20:56:29,359 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:56:29,464 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-29 20:56:29,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:29,474 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2020-11-29 20:56:29,476 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:29,484 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2020-11-29 20:56:29,485 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:56:29,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:56:29,574 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-29 20:56:29,574 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:138, output treesize:25 [2020-11-29 20:57:26,268 WARN L193 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 30 [2020-11-29 20:57:26,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:26,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:57:26,452 INFO L384 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 34 treesize of output 14 [2020-11-29 20:57:26,453 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:57:26,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:57:26,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2020-11-29 20:57:26,472 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:57:26,577 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-11-29 20:57:26,578 INFO L625 ElimStorePlain]: treesize reduction 91, result has 42.8 percent of original size [2020-11-29 20:57:26,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:57:26,586 INFO L384 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 37 treesize of output 17 [2020-11-29 20:57:26,586 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:57:26,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:57:26,618 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:57:26,618 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:197, output treesize:46 [2020-11-29 20:57:26,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:26,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:27,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:28,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:28,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:29,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:30,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:30,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:30,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:30,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:32,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:32,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:32,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:32,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:33,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:34,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:34,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:57:34,795 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-29 20:57:34,803 INFO L384 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 22 treesize of output 10 [2020-11-29 20:57:34,803 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:57:34,854 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.0 percent of original size [2020-11-29 20:57:34,864 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:57:34,867 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:57:34,867 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2020-11-29 20:57:34,868 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:57:34,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:57:34,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:57:34,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:12 [2020-11-29 20:57:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 20:57:34,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:57:34,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31] total 64 [2020-11-29 20:57:34,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627897459] [2020-11-29 20:57:34,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2020-11-29 20:57:34,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:57:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2020-11-29 20:57:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3944, Unknown=25, NotChecked=0, Total=4160 [2020-11-29 20:57:34,968 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 65 states. [2020-11-29 20:57:53,498 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-11-29 20:57:53,865 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-11-29 20:57:54,979 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2020-11-29 20:57:55,323 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-11-29 20:57:55,648 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-11-29 20:58:02,558 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2020-11-29 20:58:02,881 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-29 20:58:05,276 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-11-29 20:58:08,077 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-11-29 20:58:08,441 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-29 20:58:08,733 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-11-29 20:58:11,809 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-29 20:58:12,152 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2020-11-29 20:58:12,677 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-11-29 20:58:13,123 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-11-29 20:58:14,067 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-11-29 20:58:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:58:15,110 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-11-29 20:58:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 20:58:15,115 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 89 [2020-11-29 20:58:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:58:15,117 INFO L225 Difference]: With dead ends: 115 [2020-11-29 20:58:15,117 INFO L226 Difference]: Without dead ends: 115 [2020-11-29 20:58:15,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 53 SyntacticMatches, 19 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 74.2s TimeCoverageRelationStatistics Valid=628, Invalid=8467, Unknown=25, NotChecked=0, Total=9120 [2020-11-29 20:58:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-29 20:58:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-11-29 20:58:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-29 20:58:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2020-11-29 20:58:15,126 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 89 [2020-11-29 20:58:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:58:15,127 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2020-11-29 20:58:15,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2020-11-29 20:58:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2020-11-29 20:58:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 20:58:15,128 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:58:15,129 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:58:15,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:58:15,329 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:58:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:58:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash -278275039, now seen corresponding path program 1 times [2020-11-29 20:58:15,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:58:15,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590078479] [2020-11-29 20:58:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:58:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:58:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:58:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:58:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:58:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:58:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:58:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:58:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:58:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-29 20:58:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-29 20:58:15,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590078479] [2020-11-29 20:58:15,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:58:15,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 20:58:15,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050343728] [2020-11-29 20:58:15,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 20:58:15,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:58:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 20:58:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:58:15,815 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 16 states. [2020-11-29 20:58:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:58:16,734 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2020-11-29 20:58:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 20:58:16,735 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2020-11-29 20:58:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:58:16,736 INFO L225 Difference]: With dead ends: 113 [2020-11-29 20:58:16,736 INFO L226 Difference]: Without dead ends: 111 [2020-11-29 20:58:16,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2020-11-29 20:58:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-29 20:58:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2020-11-29 20:58:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-29 20:58:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2020-11-29 20:58:16,741 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 89 [2020-11-29 20:58:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:58:16,741 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2020-11-29 20:58:16,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 20:58:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2020-11-29 20:58:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-29 20:58:16,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:58:16,742 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:58:16,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 20:58:16,743 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:58:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:58:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1045095917, now seen corresponding path program 1 times [2020-11-29 20:58:16,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:58:16,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007050263] [2020-11-29 20:58:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:58:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:16,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:58:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:16,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:58:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:58:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:58:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:58:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:58:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:58:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:58:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-29 20:58:17,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007050263] [2020-11-29 20:58:17,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:58:17,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 20:58:17,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050782640] [2020-11-29 20:58:17,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:58:17,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:58:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:58:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:58:17,158 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 15 states. [2020-11-29 20:58:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:58:18,235 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-11-29 20:58:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 20:58:18,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-11-29 20:58:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:58:18,238 INFO L225 Difference]: With dead ends: 109 [2020-11-29 20:58:18,238 INFO L226 Difference]: Without dead ends: 109 [2020-11-29 20:58:18,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2020-11-29 20:58:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-29 20:58:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2020-11-29 20:58:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-29 20:58:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2020-11-29 20:58:18,243 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 90 [2020-11-29 20:58:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:58:18,243 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2020-11-29 20:58:18,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:58:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2020-11-29 20:58:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-29 20:58:18,244 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:58:18,244 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:58:18,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 20:58:18,245 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:58:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:58:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 686593336, now seen corresponding path program 1 times [2020-11-29 20:58:18,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:58:18,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535267429] [2020-11-29 20:58:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:58:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:18,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:58:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:18,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:58:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:18,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:58:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:58:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:58:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:58:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:58:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:58:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-29 20:58:19,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535267429] [2020-11-29 20:58:19,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6956697] [2020-11-29 20:58:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:58:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:20,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 88 conjunts are in the unsatisfiable core [2020-11-29 20:58:20,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:58:20,137 INFO L384 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 [2020-11-29 20:58:20,138 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:20,151 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,151 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-29 20:58:20,644 INFO L384 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 [2020-11-29 20:58:20,645 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:20,653 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2020-11-29 20:58:20,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:20,919 INFO L384 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 [2020-11-29 20:58:20,919 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:20,930 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:20,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-29 20:58:21,099 INFO L384 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 [2020-11-29 20:58:21,099 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:21,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:21,116 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:21,116 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-11-29 20:58:21,316 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:21,317 INFO L384 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 35 treesize of output 49 [2020-11-29 20:58:21,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 20:58:21,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:58:21,318 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:21,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:21,330 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:58:21,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2020-11-29 20:58:21,913 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:21,913 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2020-11-29 20:58:21,915 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:21,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:21,924 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:21,925 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2020-11-29 20:58:35,907 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:58:36,054 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 20:58:36,054 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:36,055 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 182 [2020-11-29 20:58:36,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:58:36,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:58:36,057 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:36,119 INFO L625 ElimStorePlain]: treesize reduction 117, result has 26.4 percent of original size [2020-11-29 20:58:36,121 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:36,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:22 [2020-11-29 20:58:36,135 INFO L384 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 18 treesize of output 10 [2020-11-29 20:58:36,136 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:36,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:36,139 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:36,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:3 [2020-11-29 20:58:38,247 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2020-11-29 20:58:38,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:58:38,259 INFO L384 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 37 treesize of output 17 [2020-11-29 20:58:38,259 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:38,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:38,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:38,273 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-11-29 20:58:39,011 INFO L384 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 25 treesize of output 13 [2020-11-29 20:58:39,012 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-29 20:58:39,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:39,044 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:39,044 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2020-11-29 20:58:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2020-11-29 20:58:40,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:58:40,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 57 [2020-11-29 20:58:40,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9950419] [2020-11-29 20:58:40,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 58 states [2020-11-29 20:58:40,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:58:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2020-11-29 20:58:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3015, Unknown=5, NotChecked=110, Total=3306 [2020-11-29 20:58:40,589 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 58 states. [2020-11-29 20:58:43,214 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-11-29 20:58:44,394 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-29 20:58:51,091 WARN L193 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-11-29 20:58:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:58:53,917 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2020-11-29 20:58:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 20:58:53,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 92 [2020-11-29 20:58:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:58:53,920 INFO L225 Difference]: With dead ends: 110 [2020-11-29 20:58:53,920 INFO L226 Difference]: Without dead ends: 110 [2020-11-29 20:58:53,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=517, Invalid=6454, Unknown=5, NotChecked=164, Total=7140 [2020-11-29 20:58:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-29 20:58:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2020-11-29 20:58:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-29 20:58:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2020-11-29 20:58:53,925 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 92 [2020-11-29 20:58:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:58:53,925 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2020-11-29 20:58:53,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2020-11-29 20:58:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2020-11-29 20:58:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-29 20:58:53,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:58:53,927 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:58:54,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-11-29 20:58:54,138 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:58:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:58:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1892804907, now seen corresponding path program 1 times [2020-11-29 20:58:54,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:58:54,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187951913] [2020-11-29 20:58:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:58:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:54,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:58:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:54,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:58:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:54,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 20:58:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:54,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 20:58:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:54,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 20:58:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 20:58:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 20:58:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 20:58:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-29 20:58:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 20:58:55,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187951913] [2020-11-29 20:58:55,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398037549] [2020-11-29 20:58:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:58:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:58:55,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 92 conjunts are in the unsatisfiable core [2020-11-29 20:58:55,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:58:56,124 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:56,124 INFO L384 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 [2020-11-29 20:58:56,125 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:56,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:56,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:56,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-29 20:58:56,270 INFO L384 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 [2020-11-29 20:58:56,270 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:56,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:56,280 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:58:56,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-11-29 20:58:56,437 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:56,437 INFO L384 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 28 treesize of output 46 [2020-11-29 20:58:56,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 20:58:56,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:58:56,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:58:56,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:58:56,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:58:56,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-11-29 20:59:01,991 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:59:02,122 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 20:59:02,122 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:59:02,122 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 179 [2020-11-29 20:59:02,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 20:59:02,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:59:02,125 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:59:02,181 INFO L625 ElimStorePlain]: treesize reduction 120, result has 22.6 percent of original size [2020-11-29 20:59:02,182 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:59:02,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:15 [2020-11-29 20:59:04,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2020-11-29 20:59:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:59:04,292 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2020-11-29 20:59:04,292 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:59:04,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:59:04,300 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:59:04,300 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:8 [2020-11-29 20:59:06,370 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_31 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_31) 0) v_main_~s~0.base_BEFORE_CALL_31))) is different from true [2020-11-29 20:59:08,492 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_32 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_32 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_32) 0)))) is different from true [2020-11-29 20:59:10,617 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_33 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_33) 0) v_main_~s~0.base_BEFORE_CALL_33))) is different from true [2020-11-29 20:59:18,722 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2020-11-29 20:59:18,730 INFO L384 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 [2020-11-29 20:59:18,731 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:59:18,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:59:18,743 INFO L545 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. [2020-11-29 20:59:18,743 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2020-11-29 20:59:20,853 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-29 20:59:22,966 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-29 20:59:25,092 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2020-11-29 20:59:27,323 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-29 20:59:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 9 not checked. [2020-11-29 20:59:27,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:59:27,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35] total 57 [2020-11-29 20:59:27,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334319691] [2020-11-29 20:59:27,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 57 states [2020-11-29 20:59:27,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:59:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2020-11-29 20:59:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2598, Unknown=8, NotChecked=420, Total=3192 [2020-11-29 20:59:27,374 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 57 states. [2020-11-29 20:59:32,251 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-29 20:59:38,904 WARN L193 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-11-29 20:59:53,257 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-11-29 21:00:16,117 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 47 [2020-11-29 21:00:20,402 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-29 21:00:24,636 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-29 21:00:28,867 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-29 21:00:33,161 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-29 21:00:37,496 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-11-29 21:00:39,774 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-29 21:00:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:00:40,199 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2020-11-29 21:00:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-29 21:00:40,200 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 95 [2020-11-29 21:00:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:00:40,201 INFO L225 Difference]: With dead ends: 110 [2020-11-29 21:00:40,201 INFO L226 Difference]: Without dead ends: 105 [2020-11-29 21:00:40,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 97.3s TimeCoverageRelationStatistics Valid=439, Invalid=5114, Unknown=13, NotChecked=596, Total=6162 [2020-11-29 21:00:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-29 21:00:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2020-11-29 21:00:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-29 21:00:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2020-11-29 21:00:40,216 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 95 [2020-11-29 21:00:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:00:40,217 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2020-11-29 21:00:40,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2020-11-29 21:00:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2020-11-29 21:00:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-29 21:00:40,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:00:40,218 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:00:40,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:00:40,434 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 21:00:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:00:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1667962822, now seen corresponding path program 1 times [2020-11-29 21:00:40,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:00:40,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338242971] [2020-11-29 21:00:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:00:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:40,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 21:00:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:40,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 21:00:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:41,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 21:00:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:41,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 21:00:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:42,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 21:00:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:42,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 21:00:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:43,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 21:00:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:43,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 21:00:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 21:00:43,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338242971] [2020-11-29 21:00:43,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304388398] [2020-11-29 21:00:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:00:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:00:43,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 119 conjunts are in the unsatisfiable core [2020-11-29 21:00:43,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:00:44,064 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,064 INFO L384 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 [2020-11-29 21:00:44,065 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,120 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,120 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-11-29 21:00:44,333 INFO L384 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 [2020-11-29 21:00:44,333 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,358 INFO L384 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 [2020-11-29 21:00:44,359 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,379 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:36 [2020-11-29 21:00:44,616 INFO L384 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 41 treesize of output 28 [2020-11-29 21:00:44,616 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,661 INFO L625 ElimStorePlain]: treesize reduction 7, result has 89.4 percent of original size [2020-11-29 21:00:44,690 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,690 INFO L384 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 39 treesize of output 53 [2020-11-29 21:00:44,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 21:00:44,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:00:44,691 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:44,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:44,712 INFO L545 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. [2020-11-29 21:00:44,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:51 [2020-11-29 21:00:46,561 INFO L441 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_71|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_71|]} [2020-11-29 21:00:46,568 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:00:46,570 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-11-29 21:00:46,572 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:46,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:46,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:00:46,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:00:46,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:00:46,629 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:00:46,631 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:00:46,657 INFO L350 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-11-29 21:00:46,657 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 61 [2020-11-29 21:00:46,658 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:46,717 INFO L625 ElimStorePlain]: treesize reduction 35, result has 52.1 percent of original size [2020-11-29 21:00:46,718 INFO L545 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. [2020-11-29 21:00:46,718 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:32 [2020-11-29 21:00:49,141 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2020-11-29 21:00:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:00:49,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:00:49,160 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:00:49,168 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:49,168 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2020-11-29 21:00:49,169 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:49,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:49,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 21:00:49,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:32 [2020-11-29 21:00:55,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:00:55,482 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:00:55,502 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:55,503 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2020-11-29 21:00:55,503 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:55,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:00:55,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:00:55,538 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 21:00:55,538 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:32 [2020-11-29 21:00:55,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:00:55,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:00:55,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:00:56,143 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2020-11-29 21:00:56,144 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:00:56,158 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-11-29 21:00:56,159 INFO L545 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. [2020-11-29 21:00:56,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-11-29 21:00:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2020-11-29 21:00:56,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 21:00:56,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2020-11-29 21:00:56,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134920769] [2020-11-29 21:00:56,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 70 states [2020-11-29 21:00:56,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:00:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2020-11-29 21:00:56,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4478, Unknown=2, NotChecked=134, Total=4830 [2020-11-29 21:00:56,381 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 70 states. [2020-11-29 21:01:09,575 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-29 21:01:11,013 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2020-11-29 21:01:15,688 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-11-29 21:01:28,484 WARN L193 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-11-29 21:01:31,958 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-29 21:01:32,338 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-29 21:01:32,649 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-29 21:01:33,209 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2020-11-29 21:01:33,775 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2020-11-29 21:01:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:01:34,881 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2020-11-29 21:01:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-29 21:01:34,882 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 95 [2020-11-29 21:01:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:01:34,883 INFO L225 Difference]: With dead ends: 95 [2020-11-29 21:01:34,883 INFO L226 Difference]: Without dead ends: 95 [2020-11-29 21:01:34,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=568, Invalid=7987, Unknown=5, NotChecked=182, Total=8742 [2020-11-29 21:01:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-29 21:01:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-29 21:01:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 21:01:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2020-11-29 21:01:34,889 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 95 [2020-11-29 21:01:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:01:34,889 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2020-11-29 21:01:34,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2020-11-29 21:01:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2020-11-29 21:01:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-29 21:01:34,890 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:01:34,891 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:01:35,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-11-29 21:01:35,102 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 21:01:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:01:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1231030842, now seen corresponding path program 1 times [2020-11-29 21:01:35,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:01:35,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452527676] [2020-11-29 21:01:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:01:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:35,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 21:01:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:35,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 21:01:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:36,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 21:01:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:36,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-29 21:01:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:36,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 21:01:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:36,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-29 21:01:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:37,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-29 21:01:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:37,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-29 21:01:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:37,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-29 21:01:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 21:01:37,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452527676] [2020-11-29 21:01:37,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662606404] [2020-11-29 21:01:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:01:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:01:37,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 103 conjunts are in the unsatisfiable core [2020-11-29 21:01:37,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:01:38,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-29 21:01:38,544 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:01:38,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:38,564 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 21:01:38,564 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2020-11-29 21:01:38,809 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:38,810 INFO L384 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 54 treesize of output 64 [2020-11-29 21:01:38,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-29 21:01:38,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 21:01:38,812 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:01:38,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:38,831 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 21:01:38,832 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2020-11-29 21:01:39,433 INFO L350 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2020-11-29 21:01:39,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2020-11-29 21:01:39,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:01:39,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:39,471 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:39,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2020-11-29 21:01:39,472 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 21:01:39,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:39,491 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 21:01:39,491 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:18 [2020-11-29 21:01:40,518 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:01:40,644 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 21:01:40,645 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:40,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 197 [2020-11-29 21:01:40,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-11-29 21:01:40,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 21:01:40,648 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:01:40,748 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-11-29 21:01:40,749 INFO L625 ElimStorePlain]: treesize reduction 120, result has 38.5 percent of original size [2020-11-29 21:01:40,751 INFO L545 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. [2020-11-29 21:01:40,751 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:103, output treesize:55 [2020-11-29 21:01:41,011 INFO L350 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2020-11-29 21:01:41,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2020-11-29 21:01:41,012 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:01:41,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:41,034 INFO L384 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 18 treesize of output 10 [2020-11-29 21:01:41,035 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 21:01:41,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:01:41,055 INFO L545 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. [2020-11-29 21:01:41,055 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-11-29 21:02:03,621 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2020-11-29 21:02:03,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 21:02:03,649 INFO L384 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 54 treesize of output 30 [2020-11-29 21:02:03,649 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:02:03,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:02:03,701 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 21:02:03,701 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:55 [2020-11-29 21:02:06,007 INFO L350 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2020-11-29 21:02:06,007 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2020-11-29 21:02:06,008 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:02:06,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:02:06,023 INFO L545 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. [2020-11-29 21:02:06,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2020-11-29 21:02:10,555 INFO L350 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2020-11-29 21:02:10,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2020-11-29 21:02:10,557 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:02:10,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:02:10,571 INFO L545 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. [2020-11-29 21:02:10,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2020-11-29 21:02:15,048 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:02:15,048 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-11-29 21:02:15,049 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 21:02:15,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 21:02:15,062 INFO L545 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. [2020-11-29 21:02:15,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-11-29 21:02:29,245 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2020-11-29 21:02:37,436 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2020-11-29 21:02:39,707 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-29 21:02:41,903 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-29 21:02:44,119 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 30 [2020-11-29 21:02:46,340 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 28 [2020-11-29 21:02:48,550 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2020-11-29 21:02:50,772 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2020-11-29 21:02:53,250 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2020-11-29 21:02:53,280 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:02:53,281 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 21:02:53,308 INFO L350 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-11-29 21:02:53,308 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 55 [2020-11-29 21:02:53,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:02:53,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:02:53,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:02:53,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:02:53,314 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 21:02:53,403 INFO L625 ElimStorePlain]: treesize reduction 11, result has 84.3 percent of original size [2020-11-29 21:02:53,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:02:53,410 INFO L545 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. [2020-11-29 21:02:53,410 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:90, output treesize:29 [2020-11-29 21:02:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 21:02:55,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 21:02:55,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36] total 66 [2020-11-29 21:02:55,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617120754] [2020-11-29 21:02:55,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 67 states [2020-11-29 21:02:55,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:02:55,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2020-11-29 21:02:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4196, Unknown=22, NotChecked=0, Total=4422 [2020-11-29 21:02:55,837 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 67 states. [2020-11-29 21:03:39,498 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-29 21:03:44,003 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2020-11-29 21:03:56,898 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2020-11-29 21:03:57,233 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2020-11-29 21:03:57,670 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2020-11-29 21:03:58,054 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-11-29 21:04:25,591 WARN L193 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2020-11-29 21:04:45,403 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-11-29 21:04:45,863 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-11-29 21:04:46,247 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-11-29 21:04:46,754 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-11-29 21:04:49,238 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 21:04:53,643 WARN L193 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-11-29 21:04:56,018 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 42 [2020-11-29 21:04:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:04:56,691 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-11-29 21:04:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 21:04:56,692 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 101 [2020-11-29 21:04:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:04:56,692 INFO L225 Difference]: With dead ends: 94 [2020-11-29 21:04:56,693 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 21:04:56,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 121.4s TimeCoverageRelationStatistics Valid=540, Invalid=8356, Unknown=34, NotChecked=0, Total=8930 [2020-11-29 21:04:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 21:04:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 21:04:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 21:04:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 21:04:56,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-11-29 21:04:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:04:56,694 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 21:04:56,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2020-11-29 21:04:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 21:04:56,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 21:04:56,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-11-29 21:04:56,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:04:56 BoogieIcfgContainer [2020-11-29 21:04:56,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 21:04:56,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 21:04:56,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 21:04:56,901 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 21:04:56,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:50:49" (3/4) ... [2020-11-29 21:04:56,905 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 21:04:56,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-11-29 21:04:56,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-29 21:04:56,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2020-11-29 21:04:56,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2020-11-29 21:04:56,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-11-29 21:04:56,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-11-29 21:04:56,915 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2020-11-29 21:04:56,915 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2020-11-29 21:04:56,915 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-29 21:04:56,915 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2020-11-29 21:04:56,915 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2020-11-29 21:04:56,927 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-11-29 21:04:56,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-11-29 21:04:56,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-29 21:04:56,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 21:04:57,001 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d7c29831-3d24-4e0b-bb72-2a9087998557/bin/uautomizer/witness.graphml [2020-11-29 21:04:57,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 21:04:57,003 INFO L168 Benchmark]: Toolchain (without parser) took 849039.97 ms. Allocated memory was 109.1 MB in the beginning and 247.5 MB in the end (delta: 138.4 MB). Free memory was 76.5 MB in the beginning and 85.4 MB in the end (delta: -8.9 MB). Peak memory consumption was 128.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,003 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 79.7 MB. Free memory was 51.2 MB in the beginning and 51.2 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:04:57,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.61 ms. Allocated memory is still 109.1 MB. Free memory was 75.8 MB in the beginning and 73.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,004 INFO L168 Benchmark]: Boogie Preprocessor took 76.90 ms. Allocated memory is still 109.1 MB. Free memory was 73.7 MB in the beginning and 70.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,005 INFO L168 Benchmark]: RCFGBuilder took 930.25 ms. Allocated memory is still 109.1 MB. Free memory was 70.5 MB in the beginning and 60.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,005 INFO L168 Benchmark]: TraceAbstraction took 847294.64 ms. Allocated memory was 109.1 MB in the beginning and 247.5 MB in the end (delta: 138.4 MB). Free memory was 60.6 MB in the beginning and 89.9 MB in the end (delta: -29.3 MB). Peak memory consumption was 108.7 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,005 INFO L168 Benchmark]: Witness Printer took 101.56 ms. Allocated memory is still 247.5 MB. Free memory was 89.9 MB in the beginning and 85.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 21:04:57,007 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 79.7 MB. Free memory was 51.2 MB in the beginning and 51.2 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 630.61 ms. Allocated memory is still 109.1 MB. Free memory was 75.8 MB in the beginning and 73.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.90 ms. Allocated memory is still 109.1 MB. Free memory was 73.7 MB in the beginning and 70.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 930.25 ms. Allocated memory is still 109.1 MB. Free memory was 70.5 MB in the beginning and 60.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 847294.64 ms. Allocated memory was 109.1 MB in the beginning and 247.5 MB in the end (delta: 138.4 MB). Free memory was 60.6 MB in the beginning and 89.9 MB in the end (delta: -29.3 MB). Peak memory consumption was 108.7 MB. Max. memory is 16.1 GB. * Witness Printer took 101.56 ms. Allocated memory is still 247.5 MB. Free memory was 89.9 MB in the beginning and 85.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 116 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 847.2s, OverallIterations: 35, TraceHistogramMax: 3, AutomataDifference: 505.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2179 SDtfs, 6715 SDslu, 12299 SDs, 0 SdLazy, 46338 SolverSat, 1717 SolverUnsat, 122 SolverUnknown, 0 SolverNotchecked, 288.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2516 GetRequests, 1188 SyntacticMatches, 63 SemanticMatches, 1265 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 13605 ImplicationChecksByTransitivity, 518.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 638 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 332.3s InterpolantComputationTime, 3343 NumberOfCodeBlocks, 3333 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3290 ConstructedInterpolants, 418 QuantifiedInterpolants, 3000996 SizeOfPredicates, 363 NumberOfNonLiveVariables, 6614 ConjunctsInSsa, 1200 ConjunctsInUnsatCore, 53 InterpolantComputations, 18 PerfectInterpolantSequences, 758/1139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...