./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3589167bbf5d7f5cd80f4f92aa27b7dbe19a0217 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:07:42,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:07:42,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:07:42,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:07:42,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:07:42,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:07:42,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:07:42,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:07:42,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:07:42,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:07:42,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:07:42,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:07:42,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:07:42,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:07:42,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:07:42,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:07:42,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:07:42,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:07:42,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:07:42,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:07:42,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:07:42,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:07:42,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:07:42,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:07:42,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:07:42,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:07:42,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:07:42,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:07:42,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:07:42,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:07:42,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:07:42,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:07:42,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:07:42,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:07:42,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:07:42,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:07:42,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:07:42,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:07:42,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:07:42,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:07:42,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:07:42,561 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-11-30 00:07:42,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:07:42,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:07:42,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:07:42,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:07:42,609 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:07:42,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:07:42,609 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:07:42,609 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:07:42,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:07:42,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:07:42,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:07:42,612 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:07:42,612 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:07:42,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:07:42,612 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:07:42,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:07:42,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:07:42,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:07:42,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:07:42,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:07:42,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:07:42,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:07:42,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:07:42,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:07:42,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:07:42,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:07:42,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:07:42,615 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_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-memcleanup) ) 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 -> 3589167bbf5d7f5cd80f4f92aa27b7dbe19a0217 [2020-11-30 00:07:42,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:07:42,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:07:42,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:07:42,962 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:07:42,971 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:07:42,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2020-11-30 00:07:43,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/data/058336f32/ee1b72148ec74fa9b93dc0cd9cfbbb98/FLAG8e1a1e953 [2020-11-30 00:07:43,691 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:07:43,693 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2020-11-30 00:07:43,716 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/data/058336f32/ee1b72148ec74fa9b93dc0cd9cfbbb98/FLAG8e1a1e953 [2020-11-30 00:07:43,993 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/data/058336f32/ee1b72148ec74fa9b93dc0cd9cfbbb98 [2020-11-30 00:07:43,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:07:43,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:07:44,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:07:44,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:07:44,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:07:44,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:07:43" (1/1) ... [2020-11-30 00:07:44,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6984d7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44, skipping insertion in model container [2020-11-30 00:07:44,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:07:43" (1/1) ... [2020-11-30 00:07:44,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:07:44,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:07:44,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:07:44,392 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:07:44,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:07:44,483 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:07:44,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44 WrapperNode [2020-11-30 00:07:44,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:07:44,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:07:44,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:07:44,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:07:44,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... [2020-11-30 00:07:44,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:07:44,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:07:44,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:07:44,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:07:44,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:07:44,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 00:07:44,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:07:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 00:07:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 00:07:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 00:07:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-30 00:07:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-11-30 00:07:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-11-30 00:07:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-11-30 00:07:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 00:07:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 00:07:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 00:07:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 00:07:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 00:07:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 00:07:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:07:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 00:07:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 00:07:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 00:07:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 00:07:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 00:07:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 00:07:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 00:07:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 00:07:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 00:07:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 00:07:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 00:07:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 00:07:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 00:07:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 00:07:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 00:07:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 00:07:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 00:07:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 00:07:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 00:07:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 00:07:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 00:07:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 00:07:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 00:07:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 00:07:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 00:07:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 00:07:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 00:07:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-30 00:07:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 00:07:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 00:07:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 00:07:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 00:07:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 00:07:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 00:07:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 00:07:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 00:07:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 00:07:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 00:07:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-30 00:07:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:07:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 00:07:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 00:07:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:07:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:07:44,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:07:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:07:45,056 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-30 00:07:45,362 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:07:45,362 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-30 00:07:45,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:07:45 BoogieIcfgContainer [2020-11-30 00:07:45,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:07:45,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:07:45,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:07:45,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:07:45,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:07:43" (1/3) ... [2020-11-30 00:07:45,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2671bf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:07:45, skipping insertion in model container [2020-11-30 00:07:45,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:07:44" (2/3) ... [2020-11-30 00:07:45,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2671bf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:07:45, skipping insertion in model container [2020-11-30 00:07:45,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:07:45" (3/3) ... [2020-11-30 00:07:45,377 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-11-30 00:07:45,392 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:07:45,398 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-11-30 00:07:45,414 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-11-30 00:07:45,441 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:07:45,442 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 00:07:45,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:07:45,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:07:45,443 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:07:45,443 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:07:45,443 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:07:45,443 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:07:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-11-30 00:07:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:07:45,472 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:45,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:45,477 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1778924751, now seen corresponding path program 1 times [2020-11-30 00:07:45,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:45,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314193134] [2020-11-30 00:07:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:45,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:45,878 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-30 00:07:45,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314193134] [2020-11-30 00:07:45,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:45,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:07:45,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959265709] [2020-11-30 00:07:45,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:07:45,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:07:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:07:45,907 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-11-30 00:07:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:46,261 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2020-11-30 00:07:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:07:46,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-30 00:07:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:46,282 INFO L225 Difference]: With dead ends: 87 [2020-11-30 00:07:46,283 INFO L226 Difference]: Without dead ends: 78 [2020-11-30 00:07:46,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:07:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-30 00:07:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-11-30 00:07:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 00:07:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2020-11-30 00:07:46,378 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 12 [2020-11-30 00:07:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:46,379 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2020-11-30 00:07:46,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:07:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2020-11-30 00:07:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:07:46,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:46,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:46,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:07:46,383 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1591559482, now seen corresponding path program 1 times [2020-11-30 00:07:46,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:46,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116188417] [2020-11-30 00:07:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:46,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:46,584 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-30 00:07:46,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116188417] [2020-11-30 00:07:46,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:46,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:07:46,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102877589] [2020-11-30 00:07:46,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:07:46,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:07:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:07:46,589 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 5 states. [2020-11-30 00:07:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:47,147 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2020-11-30 00:07:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:07:47,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:07:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:47,152 INFO L225 Difference]: With dead ends: 97 [2020-11-30 00:07:47,152 INFO L226 Difference]: Without dead ends: 97 [2020-11-30 00:07:47,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:07:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-30 00:07:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2020-11-30 00:07:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:07:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2020-11-30 00:07:47,179 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2020-11-30 00:07:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:47,179 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2020-11-30 00:07:47,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:07:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-11-30 00:07:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:07:47,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:47,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:47,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:07:47,183 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -183447880, now seen corresponding path program 1 times [2020-11-30 00:07:47,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:47,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803359984] [2020-11-30 00:07:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:47,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:47,308 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-30 00:07:47,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803359984] [2020-11-30 00:07:47,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:47,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:07:47,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631332598] [2020-11-30 00:07:47,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:07:47,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:07:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:07:47,319 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 4 states. [2020-11-30 00:07:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:47,550 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2020-11-30 00:07:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:07:47,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 00:07:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:47,552 INFO L225 Difference]: With dead ends: 79 [2020-11-30 00:07:47,553 INFO L226 Difference]: Without dead ends: 79 [2020-11-30 00:07:47,553 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-30 00:07:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-30 00:07:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2020-11-30 00:07:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 00:07:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2020-11-30 00:07:47,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 14 [2020-11-30 00:07:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:47,565 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2020-11-30 00:07:47,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:07:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2020-11-30 00:07:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:07:47,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:47,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:47,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:07:47,567 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash -183447879, now seen corresponding path program 1 times [2020-11-30 00:07:47,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:47,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275438814] [2020-11-30 00:07:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:47,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:47,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275438814] [2020-11-30 00:07:47,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:47,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:07:47,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978008276] [2020-11-30 00:07:47,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:07:47,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:07:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:07:47,707 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 4 states. [2020-11-30 00:07:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:47,940 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2020-11-30 00:07:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:07:47,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 00:07:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:47,943 INFO L225 Difference]: With dead ends: 78 [2020-11-30 00:07:47,943 INFO L226 Difference]: Without dead ends: 78 [2020-11-30 00:07:47,943 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-30 00:07:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-30 00:07:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-11-30 00:07:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 00:07:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2020-11-30 00:07:47,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 14 [2020-11-30 00:07:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:47,957 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2020-11-30 00:07:47,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:07:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2020-11-30 00:07:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:07:47,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:47,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:47,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:07:47,959 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 116018533, now seen corresponding path program 1 times [2020-11-30 00:07:47,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:47,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876470001] [2020-11-30 00:07:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:48,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:48,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:48,245 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-30 00:07:48,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876470001] [2020-11-30 00:07:48,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:48,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:07:48,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656531400] [2020-11-30 00:07:48,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:07:48,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:07:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:07:48,248 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 10 states. [2020-11-30 00:07:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:49,062 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-11-30 00:07:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:07:49,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-30 00:07:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:49,064 INFO L225 Difference]: With dead ends: 89 [2020-11-30 00:07:49,064 INFO L226 Difference]: Without dead ends: 89 [2020-11-30 00:07:49,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-11-30 00:07:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-30 00:07:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2020-11-30 00:07:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:07:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-11-30 00:07:49,073 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 20 [2020-11-30 00:07:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:49,073 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-11-30 00:07:49,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:07:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-11-30 00:07:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:07:49,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:49,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:49,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:07:49,075 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash -498946436, now seen corresponding path program 1 times [2020-11-30 00:07:49,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:49,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473738380] [2020-11-30 00:07:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:49,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:49,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:49,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473738380] [2020-11-30 00:07:49,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:49,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:07:49,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62722740] [2020-11-30 00:07:49,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:07:49,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:07:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:07:49,281 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 11 states. [2020-11-30 00:07:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:49,994 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-11-30 00:07:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:07:49,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-30 00:07:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:49,996 INFO L225 Difference]: With dead ends: 95 [2020-11-30 00:07:49,996 INFO L226 Difference]: Without dead ends: 95 [2020-11-30 00:07:49,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:07:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-30 00:07:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2020-11-30 00:07:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-30 00:07:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2020-11-30 00:07:50,006 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2020-11-30 00:07:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:50,006 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2020-11-30 00:07:50,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:07:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2020-11-30 00:07:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:07:50,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:50,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:50,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:07:50,008 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash -498946435, now seen corresponding path program 1 times [2020-11-30 00:07:50,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:50,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405627560] [2020-11-30 00:07:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:50,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:50,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:50,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405627560] [2020-11-30 00:07:50,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098527477] [2020-11-30 00:07:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:07:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:50,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:07:50,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:07:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:50,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:07:50,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2020-11-30 00:07:50,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495561562] [2020-11-30 00:07:50,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:07:50,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:07:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:07:50,715 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 10 states. [2020-11-30 00:07:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:51,416 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2020-11-30 00:07:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:07:51,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-30 00:07:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:51,420 INFO L225 Difference]: With dead ends: 95 [2020-11-30 00:07:51,420 INFO L226 Difference]: Without dead ends: 89 [2020-11-30 00:07:51,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:07:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-30 00:07:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2020-11-30 00:07:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-30 00:07:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2020-11-30 00:07:51,432 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2020-11-30 00:07:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:51,433 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2020-11-30 00:07:51,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:07:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-11-30 00:07:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:07:51,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:51,437 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:51,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 00:07:51,666 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1446597612, now seen corresponding path program 2 times [2020-11-30 00:07:51,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:51,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715605310] [2020-11-30 00:07:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:51,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:51,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:51,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715605310] [2020-11-30 00:07:51,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590636485] [2020-11-30 00:07:51,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:07:52,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:07:52,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:07:52,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:07:52,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:07:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:07:52,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:07:52,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2020-11-30 00:07:52,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439611493] [2020-11-30 00:07:52,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:07:52,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:07:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:07:52,235 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 11 states. [2020-11-30 00:07:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:52,897 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2020-11-30 00:07:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:07:52,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-11-30 00:07:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:52,900 INFO L225 Difference]: With dead ends: 96 [2020-11-30 00:07:52,900 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 00:07:52,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:07:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 00:07:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2020-11-30 00:07:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 00:07:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2020-11-30 00:07:52,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 28 [2020-11-30 00:07:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:52,922 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2020-11-30 00:07:52,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:07:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2020-11-30 00:07:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 00:07:52,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:52,924 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:53,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:07:53,125 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -313260501, now seen corresponding path program 3 times [2020-11-30 00:07:53,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:53,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751708678] [2020-11-30 00:07:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:53,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:53,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:07:53,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751708678] [2020-11-30 00:07:53,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:07:53,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:07:53,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490457178] [2020-11-30 00:07:53,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:07:53,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:07:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:07:53,424 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2020-11-30 00:07:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:54,062 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-11-30 00:07:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:07:54,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-11-30 00:07:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:54,063 INFO L225 Difference]: With dead ends: 83 [2020-11-30 00:07:54,064 INFO L226 Difference]: Without dead ends: 83 [2020-11-30 00:07:54,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:07:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-30 00:07:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2020-11-30 00:07:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 00:07:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-11-30 00:07:54,068 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 32 [2020-11-30 00:07:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:54,069 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-11-30 00:07:54,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:07:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-11-30 00:07:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 00:07:54,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:54,070 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:54,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:07:54,070 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 620341838, now seen corresponding path program 1 times [2020-11-30 00:07:54,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:54,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60622004] [2020-11-30 00:07:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:54,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:54,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 00:07:54,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60622004] [2020-11-30 00:07:54,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733812418] [2020-11-30 00:07:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:07:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:54,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-30 00:07:54,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:07:54,640 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-30 00:07:54,640 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:54,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:54,647 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:07:54,647 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:07:54,712 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:54,712 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-30 00:07:54,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:54,738 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 00:07:54,739 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:07:54,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-11-30 00:07:54,781 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-30 00:07:54,782 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:54,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:54,801 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-30 00:07:54,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 00:07:55,376 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:07:55,378 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 17 treesize of output 9 [2020-11-30 00:07:55,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:55,401 INFO L625 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2020-11-30 00:07:55,403 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-30 00:07:55,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2020-11-30 00:07:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:07:55,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:07:55,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2020-11-30 00:07:55,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234081006] [2020-11-30 00:07:55,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-30 00:07:55,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 00:07:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2020-11-30 00:07:55,433 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 24 states. [2020-11-30 00:07:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:07:56,962 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-11-30 00:07:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:07:56,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-11-30 00:07:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:07:56,963 INFO L225 Difference]: With dead ends: 92 [2020-11-30 00:07:56,964 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 00:07:56,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 00:07:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 00:07:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2020-11-30 00:07:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:07:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2020-11-30 00:07:56,969 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 35 [2020-11-30 00:07:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:07:56,969 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2020-11-30 00:07:56,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-30 00:07:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-11-30 00:07:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 00:07:56,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:07:56,970 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:07:57,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-30 00:07:57,181 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:07:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:07:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 620341839, now seen corresponding path program 1 times [2020-11-30 00:07:57,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:07:57,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429294910] [2020-11-30 00:07:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:07:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:57,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:07:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:57,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:07:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:07:57,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429294910] [2020-11-30 00:07:57,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092476532] [2020-11-30 00:07:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:07:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:07:57,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjunts are in the unsatisfiable core [2020-11-30 00:07:57,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:07:57,777 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-30 00:07:57,777 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:57,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:57,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:07:57,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 00:07:57,900 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:57,901 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-30 00:07:57,902 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:57,928 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-11-30 00:07:57,929 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:07:57,929 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2020-11-30 00:07:57,985 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-30 00:07:57,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:58,016 INFO L625 ElimStorePlain]: treesize reduction 7, result has 83.3 percent of original size [2020-11-30 00:07:58,021 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-30 00:07:58,021 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:58,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:58,036 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-30 00:07:58,036 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:28 [2020-11-30 00:07:58,483 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:07:58,484 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 17 treesize of output 9 [2020-11-30 00:07:58,485 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:58,512 INFO L625 ElimStorePlain]: treesize reduction 3, result has 91.9 percent of original size [2020-11-30 00:07:58,515 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:07:58,516 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 15 treesize of output 7 [2020-11-30 00:07:58,517 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:07:58,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:07:58,554 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-30 00:07:58,554 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:14 [2020-11-30 00:07:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:07:58,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:07:58,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2020-11-30 00:07:58,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596073171] [2020-11-30 00:07:58,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-30 00:07:58,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:07:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-30 00:07:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2020-11-30 00:07:58,698 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 29 states. [2020-11-30 00:08:00,339 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-11-30 00:08:00,511 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-11-30 00:08:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:01,060 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-11-30 00:08:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:08:01,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2020-11-30 00:08:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:01,062 INFO L225 Difference]: With dead ends: 89 [2020-11-30 00:08:01,062 INFO L226 Difference]: Without dead ends: 89 [2020-11-30 00:08:01,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:08:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-30 00:08:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2020-11-30 00:08:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:08:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-11-30 00:08:01,066 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 35 [2020-11-30 00:08:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:01,067 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-11-30 00:08:01,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-30 00:08:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-11-30 00:08:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:08:01,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:01,069 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:01,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:01,285 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash -640556118, now seen corresponding path program 2 times [2020-11-30 00:08:01,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:01,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797377718] [2020-11-30 00:08:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:01,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:01,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:01,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797377718] [2020-11-30 00:08:01,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959973876] [2020-11-30 00:08:01,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:01,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:08:01,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:01,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 71 conjunts are in the unsatisfiable core [2020-11-30 00:08:01,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:01,974 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-30 00:08:01,975 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:01,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:01,994 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:01,995 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 00:08:02,072 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:02,072 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-30 00:08:02,073 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,095 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 00:08:02,095 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,095 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-11-30 00:08:02,159 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-30 00:08:02,159 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:02,174 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-30 00:08:02,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 00:08:02,364 INFO L350 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-11-30 00:08:02,365 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 89 [2020-11-30 00:08:02,366 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,407 INFO L625 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size [2020-11-30 00:08:02,408 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-30 00:08:02,408 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:44 [2020-11-30 00:08:02,503 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|], 2=[|v_#memory_$Pointer$.base_12|]} [2020-11-30 00:08:02,508 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 00:08:02,508 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:02,559 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 29 treesize of output 24 [2020-11-30 00:08:02,560 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:02,623 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.4 percent of original size [2020-11-30 00:08:02,625 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-30 00:08:02,626 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:69, output treesize:59 [2020-11-30 00:08:03,392 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:03,394 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 15 treesize of output 7 [2020-11-30 00:08:03,395 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:03,468 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.6 percent of original size [2020-11-30 00:08:03,482 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 00:08:03,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:65 [2020-11-30 00:08:03,915 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:03,920 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:03,921 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:03,942 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:03,942 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 48 [2020-11-30 00:08:03,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:08:03,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:08:03,949 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-30 00:08:04,027 INFO L625 ElimStorePlain]: treesize reduction 7, result has 85.7 percent of original size [2020-11-30 00:08:04,034 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-30 00:08:04,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:24 [2020-11-30 00:08:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:04,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:04,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2020-11-30 00:08:04,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065029601] [2020-11-30 00:08:04,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-30 00:08:04,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-30 00:08:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 00:08:04,232 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 36 states. [2020-11-30 00:08:08,033 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2020-11-30 00:08:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:10,445 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-11-30 00:08:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 00:08:10,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2020-11-30 00:08:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:10,447 INFO L225 Difference]: With dead ends: 101 [2020-11-30 00:08:10,447 INFO L226 Difference]: Without dead ends: 101 [2020-11-30 00:08:10,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=318, Invalid=2543, Unknown=1, NotChecked=0, Total=2862 [2020-11-30 00:08:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-30 00:08:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2020-11-30 00:08:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:08:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-11-30 00:08:10,454 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 38 [2020-11-30 00:08:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:10,454 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-11-30 00:08:10,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-30 00:08:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-11-30 00:08:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:08:10,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:10,456 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:10,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-30 00:08:10,674 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash -640556117, now seen corresponding path program 2 times [2020-11-30 00:08:10,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:10,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857566581] [2020-11-30 00:08:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:10,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:10,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:11,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857566581] [2020-11-30 00:08:11,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000195793] [2020-11-30 00:08:11,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:11,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:08:11,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:11,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2020-11-30 00:08:11,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:11,501 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-30 00:08:11,501 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,507 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,510 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-30 00:08:11,510 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,516 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 00:08:11,661 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,661 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-30 00:08:11,662 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,679 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-30 00:08:11,679 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,691 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 00:08:11,752 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-30 00:08:11,753 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,785 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-30 00:08:11,786 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,800 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-30 00:08:11,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2020-11-30 00:08:11,930 INFO L441 ElimStorePlain]: Different costs {1=[|v_#valid_33|], 3=[|v_#length_22|]} [2020-11-30 00:08:11,958 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,958 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-30 00:08:11,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:11,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,998 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:11,998 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 52 [2020-11-30 00:08:11,999 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:12,047 INFO L625 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2020-11-30 00:08:12,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:08:12,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:51 [2020-11-30 00:08:12,172 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 19 treesize of output 18 [2020-11-30 00:08:12,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:12,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:12,214 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 29 treesize of output 24 [2020-11-30 00:08:12,215 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:12,279 INFO L625 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2020-11-30 00:08:12,281 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-30 00:08:12,281 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:74 [2020-11-30 00:08:13,440 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:13,442 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:13,443 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:13,465 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:13,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 62 [2020-11-30 00:08:13,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:08:13,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:08:13,469 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-30 00:08:13,559 INFO L625 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2020-11-30 00:08:13,565 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:13,583 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:13,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2020-11-30 00:08:13,584 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:13,636 INFO L625 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2020-11-30 00:08:13,641 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:08:13,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:27 [2020-11-30 00:08:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:13,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:13,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2020-11-30 00:08:13,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647605854] [2020-11-30 00:08:13,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-11-30 00:08:13,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-30 00:08:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 00:08:13,875 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 39 states. [2020-11-30 00:08:16,056 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2020-11-30 00:08:17,098 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2020-11-30 00:08:17,406 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2020-11-30 00:08:17,931 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2020-11-30 00:08:18,234 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2020-11-30 00:08:18,513 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-11-30 00:08:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:19,362 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-11-30 00:08:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-30 00:08:19,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2020-11-30 00:08:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:19,364 INFO L225 Difference]: With dead ends: 98 [2020-11-30 00:08:19,364 INFO L226 Difference]: Without dead ends: 98 [2020-11-30 00:08:19,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=364, Invalid=3176, Unknown=0, NotChecked=0, Total=3540 [2020-11-30 00:08:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-30 00:08:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2020-11-30 00:08:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:08:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2020-11-30 00:08:19,370 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2020-11-30 00:08:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:19,371 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2020-11-30 00:08:19,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-11-30 00:08:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-11-30 00:08:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 00:08:19,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:19,372 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:19,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:19,585 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1466607831, now seen corresponding path program 1 times [2020-11-30 00:08:19,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:19,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907427018] [2020-11-30 00:08:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:19,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:19,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:19,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-30 00:08:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:08:19,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907427018] [2020-11-30 00:08:19,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:08:19,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-30 00:08:19,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652658490] [2020-11-30 00:08:19,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:08:19,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:08:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:08:19,801 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 11 states. [2020-11-30 00:08:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:20,359 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-11-30 00:08:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:08:20,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-11-30 00:08:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:20,360 INFO L225 Difference]: With dead ends: 88 [2020-11-30 00:08:20,360 INFO L226 Difference]: Without dead ends: 85 [2020-11-30 00:08:20,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:08:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-30 00:08:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2020-11-30 00:08:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:08:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2020-11-30 00:08:20,369 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 39 [2020-11-30 00:08:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:20,369 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2020-11-30 00:08:20,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:08:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-11-30 00:08:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-30 00:08:20,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:20,371 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:20,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:08:20,371 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -267592498, now seen corresponding path program 3 times [2020-11-30 00:08:20,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:20,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711534509] [2020-11-30 00:08:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:20,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:20,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:21,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711534509] [2020-11-30 00:08:21,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119935563] [2020-11-30 00:08:21,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:21,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 00:08:21,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:21,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 86 conjunts are in the unsatisfiable core [2020-11-30 00:08:21,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:21,972 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-30 00:08:21,972 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:21,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:21,982 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:21,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 00:08:22,063 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-30 00:08:22,063 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,098 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-30 00:08:22,099 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,114 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,114 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-11-30 00:08:22,288 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,289 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 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-30 00:08:22,290 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,340 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-11-30 00:08:22,340 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,340 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2020-11-30 00:08:22,446 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 19 treesize of output 18 [2020-11-30 00:08:22,446 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,497 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 19 treesize of output 18 [2020-11-30 00:08:22,497 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,530 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2020-11-30 00:08:22,790 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,791 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-11-30 00:08:22,791 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:22,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:22,828 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-30 00:08:22,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:62 [2020-11-30 00:08:22,983 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:23,009 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:23,009 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 50 treesize of output 75 [2020-11-30 00:08:23,010 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:23,075 INFO L625 ElimStorePlain]: treesize reduction 52, result has 60.6 percent of original size [2020-11-30 00:08:23,080 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-30 00:08:23,080 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:23,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:23,108 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-30 00:08:23,108 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:94 [2020-11-30 00:08:24,557 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:24,560 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:24,561 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:08:24,667 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-11-30 00:08:24,667 INFO L350 Elim1Store]: treesize reduction 16, result has 82.6 percent of original size [2020-11-30 00:08:24,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 131 [2020-11-30 00:08:24,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-30 00:08:24,672 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-30 00:08:24,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:08:24,674 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-30 00:08:24,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:08:24,676 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 00:08:24,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-30 00:08:24,681 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-30 00:08:24,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:08:24,682 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-30 00:08:24,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:08:24,684 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 00:08:24,686 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-30 00:08:24,789 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-11-30 00:08:24,790 INFO L625 ElimStorePlain]: treesize reduction 68, result has 51.8 percent of original size [2020-11-30 00:08:24,805 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:24,805 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 35 [2020-11-30 00:08:24,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:08:24,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:08:24,808 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:24,856 INFO L625 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2020-11-30 00:08:24,862 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:24,862 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:151, output treesize:7 [2020-11-30 00:08:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:25,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:25,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2020-11-30 00:08:25,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727339171] [2020-11-30 00:08:25,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-11-30 00:08:25,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:25,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-11-30 00:08:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1886, Unknown=0, NotChecked=0, Total=1980 [2020-11-30 00:08:25,005 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 45 states. [2020-11-30 00:08:26,463 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2020-11-30 00:08:27,391 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2020-11-30 00:08:29,138 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 141 [2020-11-30 00:08:30,176 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-11-30 00:08:30,763 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-11-30 00:08:31,040 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-11-30 00:08:32,008 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 117 [2020-11-30 00:08:32,431 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-30 00:08:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:34,175 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2020-11-30 00:08:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:08:34,176 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2020-11-30 00:08:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:34,177 INFO L225 Difference]: With dead ends: 123 [2020-11-30 00:08:34,177 INFO L226 Difference]: Without dead ends: 123 [2020-11-30 00:08:34,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=330, Invalid=4782, Unknown=0, NotChecked=0, Total=5112 [2020-11-30 00:08:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-30 00:08:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2020-11-30 00:08:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 00:08:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-11-30 00:08:34,186 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 41 [2020-11-30 00:08:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:34,186 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-11-30 00:08:34,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-11-30 00:08:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-11-30 00:08:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 00:08:34,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:34,188 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:34,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-30 00:08:34,389 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1505329797, now seen corresponding path program 1 times [2020-11-30 00:08:34,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:34,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943069883] [2020-11-30 00:08:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:34,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:34,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:34,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-30 00:08:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:08:34,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943069883] [2020-11-30 00:08:34,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366429359] [2020-11-30 00:08:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:34,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2020-11-30 00:08:34,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:34,905 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-30 00:08:34,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:34,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:34,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-30 00:08:34,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-11-30 00:08:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:08:35,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:35,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2020-11-30 00:08:35,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569536261] [2020-11-30 00:08:35,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-30 00:08:35,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:35,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-30 00:08:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2020-11-30 00:08:35,494 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 26 states. [2020-11-30 00:08:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:43,201 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2020-11-30 00:08:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 00:08:43,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2020-11-30 00:08:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:43,203 INFO L225 Difference]: With dead ends: 114 [2020-11-30 00:08:43,203 INFO L226 Difference]: Without dead ends: 108 [2020-11-30 00:08:43,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:08:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-30 00:08:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2020-11-30 00:08:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 00:08:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-11-30 00:08:43,208 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 42 [2020-11-30 00:08:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:43,208 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-11-30 00:08:43,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-30 00:08:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-11-30 00:08:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-30 00:08:43,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:43,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-11-30 00:08:43,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-30 00:08:43,425 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2043365801, now seen corresponding path program 2 times [2020-11-30 00:08:43,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:43,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742424241] [2020-11-30 00:08:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:43,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:43,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:43,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-30 00:08:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:08:43,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742424241] [2020-11-30 00:08:43,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890746540] [2020-11-30 00:08:43,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:43,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:08:43,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:43,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 00:08:43,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:08:43,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:43,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2020-11-30 00:08:43,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490544672] [2020-11-30 00:08:43,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:08:43,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:08:43,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:08:43,799 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 10 states. [2020-11-30 00:08:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:44,443 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2020-11-30 00:08:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:08:44,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2020-11-30 00:08:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:44,445 INFO L225 Difference]: With dead ends: 129 [2020-11-30 00:08:44,446 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 00:08:44,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:08:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 00:08:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2020-11-30 00:08:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-30 00:08:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2020-11-30 00:08:44,452 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 45 [2020-11-30 00:08:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:44,452 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2020-11-30 00:08:44,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:08:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2020-11-30 00:08:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:08:44,458 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:44,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-30 00:08:44,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-30 00:08:44,681 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:44,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1078371956, now seen corresponding path program 1 times [2020-11-30 00:08:44,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:44,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818671015] [2020-11-30 00:08:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:44,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:44,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:44,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-30 00:08:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:08:44,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818671015] [2020-11-30 00:08:44,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:08:44,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:08:44,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048629692] [2020-11-30 00:08:44,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:08:44,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:08:44,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:08:44,879 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 11 states. [2020-11-30 00:08:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:45,434 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-11-30 00:08:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:08:45,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-11-30 00:08:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:45,436 INFO L225 Difference]: With dead ends: 122 [2020-11-30 00:08:45,436 INFO L226 Difference]: Without dead ends: 122 [2020-11-30 00:08:45,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:08:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-30 00:08:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2020-11-30 00:08:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-30 00:08:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2020-11-30 00:08:45,442 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 46 [2020-11-30 00:08:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:45,443 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2020-11-30 00:08:45,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:08:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2020-11-30 00:08:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:08:45,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:45,444 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-30 00:08:45,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:08:45,445 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1078371955, now seen corresponding path program 1 times [2020-11-30 00:08:45,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:45,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180507924] [2020-11-30 00:08:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:45,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:45,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:45,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-30 00:08:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 00:08:45,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180507924] [2020-11-30 00:08:45,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:08:45,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:08:45,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127792351] [2020-11-30 00:08:45,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:08:45,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:08:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:08:45,743 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 11 states. [2020-11-30 00:08:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:46,329 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2020-11-30 00:08:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:08:46,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-11-30 00:08:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:46,331 INFO L225 Difference]: With dead ends: 117 [2020-11-30 00:08:46,331 INFO L226 Difference]: Without dead ends: 117 [2020-11-30 00:08:46,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:08:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-30 00:08:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2020-11-30 00:08:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-30 00:08:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2020-11-30 00:08:46,340 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 46 [2020-11-30 00:08:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:46,340 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2020-11-30 00:08:46,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:08:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2020-11-30 00:08:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-30 00:08:46,342 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:46,342 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:46,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:08:46,343 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash -579936233, now seen corresponding path program 4 times [2020-11-30 00:08:46,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:46,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135014718] [2020-11-30 00:08:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:46,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:08:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:46,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 00:08:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:08:46,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135014718] [2020-11-30 00:08:46,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457580108] [2020-11-30 00:08:46,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/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-30 00:08:46,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:08:46,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:46,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:08:46,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:08:46,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:46,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2020-11-30 00:08:46,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442871541] [2020-11-30 00:08:46,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:08:46,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:08:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:08:46,903 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 12 states. [2020-11-30 00:08:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:47,513 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-11-30 00:08:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:08:47,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-11-30 00:08:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:08:47,515 INFO L225 Difference]: With dead ends: 122 [2020-11-30 00:08:47,515 INFO L226 Difference]: Without dead ends: 122 [2020-11-30 00:08:47,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:08:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-30 00:08:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2020-11-30 00:08:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-30 00:08:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2020-11-30 00:08:47,522 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 45 [2020-11-30 00:08:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:08:47,523 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2020-11-30 00:08:47,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:08:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2020-11-30 00:08:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:08:47,524 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:08:47,525 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:47,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:47,749 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-11-30 00:08:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1856012293, now seen corresponding path program 3 times [2020-11-30 00:08:47,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:47,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122759111] [2020-11-30 00:08:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:47,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:47,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:47,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:47,822 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:08:47,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:08:47,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:08:47 BoogieIcfgContainer [2020-11-30 00:08:47,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:08:47,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:08:47,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:08:47,867 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:08:47,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:07:45" (3/4) ... [2020-11-30 00:08:47,871 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:08:47,936 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd9010e1-734f-4e7c-8edc-5d81180cfd72/bin/uautomizer/witness.graphml [2020-11-30 00:08:47,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:08:47,937 INFO L168 Benchmark]: Toolchain (without parser) took 63937.95 ms. Allocated memory was 92.3 MB in the beginning and 237.0 MB in the end (delta: 144.7 MB). Free memory was 60.5 MB in the beginning and 101.7 MB in the end (delta: -41.3 MB). Peak memory consumption was 103.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,945 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 92.3 MB. Free memory was 49.2 MB in the beginning and 49.1 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:08:47,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.20 ms. Allocated memory is still 92.3 MB. Free memory was 60.3 MB in the beginning and 57.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,946 INFO L168 Benchmark]: Boogie Preprocessor took 58.37 ms. Allocated memory is still 92.3 MB. Free memory was 57.1 MB in the beginning and 54.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,947 INFO L168 Benchmark]: RCFGBuilder took 821.18 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 54.6 MB in the beginning and 65.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,947 INFO L168 Benchmark]: TraceAbstraction took 62498.74 ms. Allocated memory was 111.1 MB in the beginning and 237.0 MB in the end (delta: 125.8 MB). Free memory was 64.7 MB in the beginning and 105.9 MB in the end (delta: -41.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,948 INFO L168 Benchmark]: Witness Printer took 69.42 ms. Allocated memory is still 237.0 MB. Free memory was 105.9 MB in the beginning and 101.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:47,950 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.37 ms. Allocated memory is still 92.3 MB. Free memory was 49.2 MB in the beginning and 49.1 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 483.20 ms. Allocated memory is still 92.3 MB. Free memory was 60.3 MB in the beginning and 57.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.37 ms. Allocated memory is still 92.3 MB. Free memory was 57.1 MB in the beginning and 54.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 821.18 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 54.6 MB in the beginning and 65.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 62498.74 ms. Allocated memory was 111.1 MB in the beginning and 237.0 MB in the end (delta: 125.8 MB). Free memory was 64.7 MB in the beginning and 105.9 MB in the end (delta: -41.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 16.1 GB. * Witness Printer took 69.42 ms. Allocated memory is still 237.0 MB. Free memory was 105.9 MB in the beginning and 101.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L603] int len = 2; VAL [len=2] [L604] len < 32 && __VERIFIER_nondet_int() [L604] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L604] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L607] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L575] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] new_head->next = head VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L607] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L607] SLL s = sll_create(len + 1); [L608] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L588] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L589] COND TRUE \read(head) [L590] len++ VAL [head={-3:0}, head={-3:0}, len=1] [L591] EXPR head->next VAL [head={-3:0}, head={-3:0}, head->next={-2:0}, len=1] [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ VAL [head={-2:0}, head={-3:0}, len=2] [L591] EXPR head->next VAL [head={-2:0}, head={-3:0}, head->next={-1:0}, len=2] [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ VAL [head={-1:0}, head={-3:0}, len=3] [L591] EXPR head->next VAL [head={-1:0}, head={-3:0}, head->next={0:0}, len=3] [L591] head = head->next [L589] COND FALSE !(\read(head)) VAL [head={0:0}, head={-3:0}, len=3] [L593] return len; VAL [\result=3, head={0:0}, head={-3:0}, len=3] [L608] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L608] COND TRUE len != sll_length(s) [L613] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_length_check-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 71 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 62.3s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 852 SDtfs, 2303 SDslu, 2756 SDs, 0 SdLazy, 13416 SolverSat, 542 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 361 SyntacticMatches, 7 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 26.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=19, 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, 20 MinimizatonAttempts, 374 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 973 ConstructedInterpolants, 89 QuantifiedInterpolants, 416690 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2209 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 257/459 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 incorrect! Received shutdown request...