./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16891def4f6ae6ab6c00fe328146dbdee1a68356 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:13:59,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:13:59,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:13:59,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:13:59,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:13:59,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:13:59,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:14:00,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:14:00,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:14:00,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:14:00,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:14:00,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:14:00,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:14:00,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:14:00,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:14:00,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:14:00,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:14:00,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:14:00,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:14:00,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:14:00,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:14:00,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:14:00,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:14:00,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:14:00,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:14:00,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:14:00,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:14:00,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:14:00,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:14:00,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:14:00,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:14:00,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:14:00,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:14:00,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:14:00,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:14:00,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:14:00,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:14:00,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:14:00,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:14:00,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:14:00,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:14:00,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:14:00,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:14:00,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:14:00,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:14:00,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:14:00,052 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:14:00,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:14:00,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:14:00,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:14:00,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:14:00,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:14:00,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:14:00,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:14:00,054 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:14:00,054 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:14:00,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:14:00,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:14:00,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:14:00,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:14:00,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:14:00,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:14:00,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:14:00,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:00,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:14:00,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:14:00,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:14:00,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:14:00,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2019-11-15 23:14:00,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:14:00,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:14:00,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:14:00,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:14:00,099 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:14:00,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2019-11-15 23:14:00,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/data/dcd95b57f/63d2cdc0e49b4f66b19b2516d2ee5a64/FLAG2580ae594 [2019-11-15 23:14:00,614 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:14:00,614 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2019-11-15 23:14:00,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/data/dcd95b57f/63d2cdc0e49b4f66b19b2516d2ee5a64/FLAG2580ae594 [2019-11-15 23:14:00,982 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/data/dcd95b57f/63d2cdc0e49b4f66b19b2516d2ee5a64 [2019-11-15 23:14:00,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:14:00,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:14:00,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:00,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:14:01,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:14:01,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:00" (1/1) ... [2019-11-15 23:14:01,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edaafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01, skipping insertion in model container [2019-11-15 23:14:01,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:00" (1/1) ... [2019-11-15 23:14:01,012 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:14:01,059 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:14:01,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:01,395 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:14:01,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:01,479 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:14:01,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01 WrapperNode [2019-11-15 23:14:01,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:01,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:14:01,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:14:01,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:14:01,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... [2019-11-15 23:14:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:14:01,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:14:01,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:14:01,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:14:01,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:14:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:14:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:14:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:14:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:14:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:14:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 23:14:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-15 23:14:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-11-15 23:14:01,605 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-11-15 23:14:01,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:14:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:14:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:14:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:14:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:14:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:14:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:14:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:14:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:14:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:14:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:14:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:14:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:14:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:14:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:14:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:14:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:14:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:14:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:14:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:14:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:14:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:14:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:14:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:14:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:14:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:14:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:14:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:14:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:14:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:14:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:14:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:14:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:14:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:14:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:14:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:14:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:14:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:14:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:14:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:14:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:14:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:14:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:14:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:14:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:14:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:14:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:14:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:14:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:14:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:14:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:14:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:14:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:14:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:14:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:14:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:14:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:14:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:14:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:14:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:14:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:14:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:14:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 23:14:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-15 23:14:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:14:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:14:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-11-15 23:14:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:14:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-11-15 23:14:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:14:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:14:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:14:02,103 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:14:02,244 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:14:02,245 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:14:02,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:02 BoogieIcfgContainer [2019-11-15 23:14:02,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:14:02,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:14:02,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:14:02,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:14:02,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:14:00" (1/3) ... [2019-11-15 23:14:02,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a0ade2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:02, skipping insertion in model container [2019-11-15 23:14:02,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:01" (2/3) ... [2019-11-15 23:14:02,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a0ade2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:02, skipping insertion in model container [2019-11-15 23:14:02,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:02" (3/3) ... [2019-11-15 23:14:02,253 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-11-15 23:14:02,261 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:14:02,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-11-15 23:14:02,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-11-15 23:14:02,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:14:02,289 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:14:02,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:14:02,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:14:02,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:14:02,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:14:02,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:14:02,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:14:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-15 23:14:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:14:02,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:02,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:02,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092252, now seen corresponding path program 1 times [2019-11-15 23:14:02,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:02,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129770692] [2019-11-15 23:14:02,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:02,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129770692] [2019-11-15 23:14:02,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:02,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:02,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78880622] [2019-11-15 23:14:02,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:02,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:02,525 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2019-11-15 23:14:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:02,900 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-15 23:14:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:02,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:14:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:02,914 INFO L225 Difference]: With dead ends: 129 [2019-11-15 23:14:02,914 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:14:02,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:14:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2019-11-15 23:14:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 23:14:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-15 23:14:02,986 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2019-11-15 23:14:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:02,986 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-15 23:14:02,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-15 23:14:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:14:02,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:02,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:02,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092251, now seen corresponding path program 1 times [2019-11-15 23:14:02,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:02,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999349344] [2019-11-15 23:14:02,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:03,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999349344] [2019-11-15 23:14:03,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:03,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:03,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147089036] [2019-11-15 23:14:03,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:03,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:03,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:03,124 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-15 23:14:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:03,411 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-11-15 23:14:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:03,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:14:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:03,413 INFO L225 Difference]: With dead ends: 119 [2019-11-15 23:14:03,413 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:14:03,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:14:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2019-11-15 23:14:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:14:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-15 23:14:03,432 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 12 [2019-11-15 23:14:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:03,432 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-15 23:14:03,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-15 23:14:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:14:03,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:03,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:03,434 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash 322104282, now seen corresponding path program 1 times [2019-11-15 23:14:03,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:03,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224079895] [2019-11-15 23:14:03,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:03,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224079895] [2019-11-15 23:14:03,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:03,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:14:03,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595471111] [2019-11-15 23:14:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:14:03,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:03,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:14:03,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:03,591 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 7 states. [2019-11-15 23:14:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:04,147 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-11-15 23:14:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:14:04,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 23:14:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:04,150 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:14:04,150 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:14:04,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:14:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:14:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-11-15 23:14:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:14:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-15 23:14:04,159 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 20 [2019-11-15 23:14:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:04,161 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-15 23:14:04,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:14:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-15 23:14:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:14:04,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:04,162 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:04,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:04,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193716, now seen corresponding path program 1 times [2019-11-15 23:14:04,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:04,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661498086] [2019-11-15 23:14:04,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:04,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661498086] [2019-11-15 23:14:04,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:04,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:14:04,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877422804] [2019-11-15 23:14:04,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:14:04,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:14:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:14:04,399 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 9 states. [2019-11-15 23:14:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:04,908 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2019-11-15 23:14:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:04,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 23:14:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:04,910 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:14:04,910 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:14:04,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:14:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:14:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2019-11-15 23:14:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 23:14:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-15 23:14:04,923 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2019-11-15 23:14:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:04,923 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-15 23:14:04,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:14:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-15 23:14:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:14:04,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:04,925 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:04,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193717, now seen corresponding path program 1 times [2019-11-15 23:14:04,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:04,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009121748] [2019-11-15 23:14:04,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:14:05,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009121748] [2019-11-15 23:14:05,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:05,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:14:05,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346988583] [2019-11-15 23:14:05,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:14:05,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:14:05,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:05,068 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 8 states. [2019-11-15 23:14:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:05,516 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2019-11-15 23:14:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:05,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 23:14:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:05,518 INFO L225 Difference]: With dead ends: 119 [2019-11-15 23:14:05,518 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:14:05,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:14:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2019-11-15 23:14:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 23:14:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-15 23:14:05,525 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2019-11-15 23:14:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:05,525 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-15 23:14:05,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:14:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-15 23:14:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:14:05,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:05,533 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:05,534 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973588, now seen corresponding path program 1 times [2019-11-15 23:14:05,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:05,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54888032] [2019-11-15 23:14:05,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:05,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:05,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:05,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54888032] [2019-11-15 23:14:05,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016899330] [2019-11-15 23:14:05,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:14:05,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:06,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:06,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:06,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-15 23:14:06,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:06,060 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:14:06,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:06,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 23:14:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:06,070 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:06,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 23:14:06,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406146209] [2019-11-15 23:14:06,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:14:06,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:14:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:14:06,072 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 12 states. [2019-11-15 23:14:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:07,122 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-11-15 23:14:07,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:14:07,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-15 23:14:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:07,126 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:14:07,126 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:14:07,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:14:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:14:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-11-15 23:14:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:14:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-11-15 23:14:07,140 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2019-11-15 23:14:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:07,141 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-11-15 23:14:07,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:14:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-11-15 23:14:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:14:07,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:07,142 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:07,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:07,347 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973587, now seen corresponding path program 1 times [2019-11-15 23:14:07,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:07,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134151924] [2019-11-15 23:14:07,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:07,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:07,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134151924] [2019-11-15 23:14:07,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079310051] [2019-11-15 23:14:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:14:07,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:07,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:14:07,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:07,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:07,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:07,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:14:07,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:07,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 23:14:07,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:07,914 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 23:14:07,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:07,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 23:14:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:07,923 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:07,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-15 23:14:07,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78639057] [2019-11-15 23:14:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:14:07,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:14:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:14:07,925 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 12 states. [2019-11-15 23:14:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:08,646 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-11-15 23:14:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:14:08,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-15 23:14:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:08,648 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:14:08,648 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:14:08,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:14:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:14:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2019-11-15 23:14:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:14:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-11-15 23:14:08,666 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2019-11-15 23:14:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:08,666 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-11-15 23:14:08,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:14:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-11-15 23:14:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:14:08,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:08,670 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:08,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:08,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 657593987, now seen corresponding path program 1 times [2019-11-15 23:14:08,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:08,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043211991] [2019-11-15 23:14:08,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:08,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:09,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043211991] [2019-11-15 23:14:09,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666222617] [2019-11-15 23:14:09,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:14:09,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:09,206 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:09,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-15 23:14:09,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709670718] [2019-11-15 23:14:09,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:14:09,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:14:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:09,207 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2019-11-15 23:14:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:09,581 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-11-15 23:14:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:09,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-15 23:14:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:09,583 INFO L225 Difference]: With dead ends: 124 [2019-11-15 23:14:09,583 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 23:14:09,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 23:14:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2019-11-15 23:14:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:14:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-11-15 23:14:09,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2019-11-15 23:14:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:09,591 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-11-15 23:14:09,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:14:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-11-15 23:14:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:14:09,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:09,592 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:09,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:09,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203578, now seen corresponding path program 1 times [2019-11-15 23:14:09,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:09,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503704126] [2019-11-15 23:14:09,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:09,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:09,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:10,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503704126] [2019-11-15 23:14:10,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933561253] [2019-11-15 23:14:10,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:10,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:14:10,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:10,178 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:10,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-15 23:14:10,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792765157] [2019-11-15 23:14:10,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:14:10,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:14:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:14:10,180 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 11 states. [2019-11-15 23:14:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:10,750 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-15 23:14:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:14:10,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-15 23:14:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:10,752 INFO L225 Difference]: With dead ends: 134 [2019-11-15 23:14:10,753 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 23:14:10,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 23:14:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2019-11-15 23:14:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:14:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-11-15 23:14:10,759 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 35 [2019-11-15 23:14:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:10,759 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-11-15 23:14:10,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:14:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-11-15 23:14:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:14:10,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:10,761 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:10,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:10,964 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203579, now seen corresponding path program 1 times [2019-11-15 23:14:10,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:10,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628400213] [2019-11-15 23:14:10,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:10,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:10,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:14:11,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628400213] [2019-11-15 23:14:11,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274089792] [2019-11-15 23:14:11,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:14:11,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:14:11,242 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:11,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-11-15 23:14:11,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798075416] [2019-11-15 23:14:11,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:14:11,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:14:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:11,243 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 7 states. [2019-11-15 23:14:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:11,604 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2019-11-15 23:14:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:11,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-15 23:14:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:11,606 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:14:11,606 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:14:11,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:14:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2019-11-15 23:14:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:14:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-11-15 23:14:11,611 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 35 [2019-11-15 23:14:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:11,611 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-11-15 23:14:11,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:14:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-11-15 23:14:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:14:11,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:11,613 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:11,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:11,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 439427422, now seen corresponding path program 1 times [2019-11-15 23:14:11,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:11,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014534201] [2019-11-15 23:14:11,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:11,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:11,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:14:11,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014534201] [2019-11-15 23:14:11,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:11,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:14:11,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657457017] [2019-11-15 23:14:11,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:14:11,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:11,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:14:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:14:11,918 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 9 states. [2019-11-15 23:14:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:12,326 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-11-15 23:14:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:14:12,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-15 23:14:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:12,328 INFO L225 Difference]: With dead ends: 126 [2019-11-15 23:14:12,328 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 23:14:12,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:14:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 23:14:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2019-11-15 23:14:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 23:14:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-11-15 23:14:12,333 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 36 [2019-11-15 23:14:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:12,333 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-11-15 23:14:12,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:14:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-11-15 23:14:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:14:12,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:12,334 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:12,334 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash 439427423, now seen corresponding path program 1 times [2019-11-15 23:14:12,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:12,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091513391] [2019-11-15 23:14:12,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:12,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091513391] [2019-11-15 23:14:12,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:12,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:14:12,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558108599] [2019-11-15 23:14:12,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:14:12,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:14:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:12,500 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 10 states. [2019-11-15 23:14:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:12,879 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2019-11-15 23:14:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:14:12,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-15 23:14:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:12,881 INFO L225 Difference]: With dead ends: 124 [2019-11-15 23:14:12,881 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 23:14:12,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:14:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 23:14:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2019-11-15 23:14:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:14:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-11-15 23:14:12,885 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 36 [2019-11-15 23:14:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:12,885 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-11-15 23:14:12,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:14:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-11-15 23:14:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:14:12,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:12,886 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:12,887 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -869726790, now seen corresponding path program 1 times [2019-11-15 23:14:12,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:12,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139084935] [2019-11-15 23:14:12,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:14:13,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139084935] [2019-11-15 23:14:13,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:13,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 23:14:13,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8870436] [2019-11-15 23:14:13,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:14:13,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:14:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:13,135 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 14 states. [2019-11-15 23:14:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:13,894 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-15 23:14:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:14:13,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-15 23:14:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:13,896 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:14:13,896 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 23:14:13,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:14:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 23:14:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2019-11-15 23:14:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:14:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-15 23:14:13,900 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 45 [2019-11-15 23:14:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:13,900 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-15 23:14:13,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:14:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-15 23:14:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:14:13,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:13,902 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:13,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -869726789, now seen corresponding path program 1 times [2019-11-15 23:14:13,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:13,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335902808] [2019-11-15 23:14:13,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:13,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:13,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:14:14,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335902808] [2019-11-15 23:14:14,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:14,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:14:14,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241741806] [2019-11-15 23:14:14,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:14:14,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:14,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:14:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:14,039 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 8 states. [2019-11-15 23:14:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:14,444 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2019-11-15 23:14:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:14:14,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-15 23:14:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:14,445 INFO L225 Difference]: With dead ends: 148 [2019-11-15 23:14:14,445 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 23:14:14,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:14:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 23:14:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2019-11-15 23:14:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:14:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-11-15 23:14:14,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 45 [2019-11-15 23:14:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:14,451 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-11-15 23:14:14,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:14:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-11-15 23:14:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:14:14,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:14,452 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:14,452 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -869726734, now seen corresponding path program 1 times [2019-11-15 23:14:14,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:14,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553610848] [2019-11-15 23:14:14,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:14,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:14,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553610848] [2019-11-15 23:14:14,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:14,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:14:14,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065281525] [2019-11-15 23:14:14,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:14:14,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:14:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:14:14,806 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 15 states. [2019-11-15 23:14:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:15,766 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2019-11-15 23:14:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:14:15,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-15 23:14:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:15,768 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:14:15,768 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:14:15,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:14:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:14:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2019-11-15 23:14:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:14:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-11-15 23:14:15,777 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 45 [2019-11-15 23:14:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:15,777 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-11-15 23:14:15,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:14:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-11-15 23:14:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:14:15,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:15,779 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:15,780 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1383731480, now seen corresponding path program 1 times [2019-11-15 23:14:15,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:15,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429833228] [2019-11-15 23:14:15,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:15,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:15,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 23:14:15,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429833228] [2019-11-15 23:14:15,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:15,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:14:15,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526109867] [2019-11-15 23:14:15,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:14:15,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:14:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:15,897 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 8 states. [2019-11-15 23:14:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:16,251 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-15 23:14:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:14:16,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-15 23:14:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:16,253 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:14:16,253 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:14:16,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:14:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2019-11-15 23:14:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:14:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-11-15 23:14:16,257 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 47 [2019-11-15 23:14:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:16,257 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-11-15 23:14:16,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:14:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-11-15 23:14:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:14:16,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:16,258 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:16,259 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555054, now seen corresponding path program 1 times [2019-11-15 23:14:16,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:16,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950693750] [2019-11-15 23:14:16,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:16,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:16,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:17,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950693750] [2019-11-15 23:14:17,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100803890] [2019-11-15 23:14:17,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:17,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-15 23:14:17,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:17,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:14:17,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-11-15 23:14:17,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:14:17,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-15 23:14:17,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:14:17,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-15 23:14:17,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:17,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:17,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2019-11-15 23:14:17,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,760 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.7 percent of original size [2019-11-15 23:14:17,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:17,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2019-11-15 23:14:17,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:17,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:17,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:17,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:17,850 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:17,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 80 [2019-11-15 23:14:17,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:17,889 INFO L567 ElimStorePlain]: treesize reduction 18, result has 76.6 percent of original size [2019-11-15 23:14:17,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:17,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:72 [2019-11-15 23:14:18,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:18,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:18,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:18,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:14:18,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:18,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 41 [2019-11-15 23:14:18,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:18,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:18,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:18,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:15 [2019-11-15 23:14:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:18,492 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:18,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2019-11-15 23:14:18,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869066944] [2019-11-15 23:14:18,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 23:14:18,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 23:14:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 23:14:18,494 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 47 states. [2019-11-15 23:14:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:20,723 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-15 23:14:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:14:20,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-11-15 23:14:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:20,725 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:14:20,725 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 23:14:20,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=289, Invalid=3371, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 23:14:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 23:14:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-11-15 23:14:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:14:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2019-11-15 23:14:20,730 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 48 [2019-11-15 23:14:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:20,730 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2019-11-15 23:14:20,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 23:14:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2019-11-15 23:14:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:14:20,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:20,731 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:20,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:20,935 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555055, now seen corresponding path program 1 times [2019-11-15 23:14:20,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:20,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640260135] [2019-11-15 23:14:20,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:20,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:20,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:14:21,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640260135] [2019-11-15 23:14:21,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158496497] [2019-11-15 23:14:21,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:22,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 85 conjunts are in the unsatisfiable core [2019-11-15 23:14:22,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:22,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:22,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 23:14:22,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:14:22,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-11-15 23:14:22,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:14:22,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:14:22,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-11-15 23:14:22,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:14:22,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,695 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.2 percent of original size [2019-11-15 23:14:22,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:14:22,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-11-15 23:14:22,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:22,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2019-11-15 23:14:22,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,961 INFO L567 ElimStorePlain]: treesize reduction 92, result has 54.2 percent of original size [2019-11-15 23:14:22,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:22,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-11-15 23:14:22,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:22,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:22,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:93 [2019-11-15 23:14:23,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:23,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 149 [2019-11-15 23:14:23,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:23,184 INFO L567 ElimStorePlain]: treesize reduction 88, result has 50.8 percent of original size [2019-11-15 23:14:23,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-11-15 23:14:23,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:23,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:23,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:23,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:147 [2019-11-15 23:14:23,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:23,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:23,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 141 [2019-11-15 23:14:23,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:23,991 INFO L567 ElimStorePlain]: treesize reduction 80, result has 52.7 percent of original size [2019-11-15 23:14:24,000 INFO L341 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2019-11-15 23:14:24,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 42 [2019-11-15 23:14:24,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:24,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:24,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:24,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:161, output treesize:23 [2019-11-15 23:14:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:24,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:24,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2019-11-15 23:14:24,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001783624] [2019-11-15 23:14:24,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 23:14:24,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 23:14:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2140, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 23:14:24,154 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 48 states. [2019-11-15 23:14:25,901 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 86 [2019-11-15 23:14:26,419 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:14:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:27,933 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-11-15 23:14:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:14:27,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-11-15 23:14:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:27,935 INFO L225 Difference]: With dead ends: 138 [2019-11-15 23:14:27,935 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 23:14:27,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=286, Invalid=4004, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:14:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 23:14:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-11-15 23:14:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:14:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-11-15 23:14:27,940 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 48 [2019-11-15 23:14:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:27,941 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-11-15 23:14:27,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 23:14:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-11-15 23:14:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:14:27,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:27,941 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:28,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:28,142 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1172512454, now seen corresponding path program 2 times [2019-11-15 23:14:28,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:28,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785808476] [2019-11-15 23:14:28,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:28,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:28,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:14:28,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785808476] [2019-11-15 23:14:28,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:28,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:14:28,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13712072] [2019-11-15 23:14:28,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:14:28,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:14:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:14:28,252 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 9 states. [2019-11-15 23:14:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:28,787 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-15 23:14:28,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:14:28,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-15 23:14:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:28,788 INFO L225 Difference]: With dead ends: 123 [2019-11-15 23:14:28,789 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 23:14:28,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:14:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 23:14:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-11-15 23:14:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:14:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-11-15 23:14:28,792 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 51 [2019-11-15 23:14:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:28,793 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-11-15 23:14:28,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:14:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-11-15 23:14:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:14:28,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:28,794 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:28,794 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 600462658, now seen corresponding path program 1 times [2019-11-15 23:14:28,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:28,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063413990] [2019-11-15 23:14:28,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:28,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:28,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:14:29,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063413990] [2019-11-15 23:14:29,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:29,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:14:29,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747056416] [2019-11-15 23:14:29,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:14:29,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:29,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:14:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:14:29,063 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 15 states. [2019-11-15 23:14:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:29,814 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-15 23:14:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:14:29,814 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-11-15 23:14:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:29,815 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:14:29,815 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 23:14:29,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:14:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 23:14:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2019-11-15 23:14:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:14:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-11-15 23:14:29,819 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2019-11-15 23:14:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:29,820 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-11-15 23:14:29,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:14:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-11-15 23:14:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:14:29,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:29,821 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:29,821 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash 600462659, now seen corresponding path program 1 times [2019-11-15 23:14:29,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:29,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093247111] [2019-11-15 23:14:29,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:29,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:29,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:14:29,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093247111] [2019-11-15 23:14:29,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488332189] [2019-11-15 23:14:29,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:14:30,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:14:30,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:30,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2019-11-15 23:14:30,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750123634] [2019-11-15 23:14:30,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:14:30,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:30,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:14:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:30,149 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 14 states. [2019-11-15 23:14:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:30,574 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-15 23:14:30,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:14:30,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-11-15 23:14:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:30,576 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:14:30,576 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 23:14:30,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:14:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 23:14:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2019-11-15 23:14:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:14:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-15 23:14:30,580 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 58 [2019-11-15 23:14:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:30,580 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-15 23:14:30,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:14:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-15 23:14:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:14:30,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:30,581 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:30,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:30,785 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash -878279738, now seen corresponding path program 1 times [2019-11-15 23:14:30,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:30,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088426933] [2019-11-15 23:14:30,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:30,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:30,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:14:30,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088426933] [2019-11-15 23:14:30,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745220744] [2019-11-15 23:14:30,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:14:31,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:14:31,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:31,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2019-11-15 23:14:31,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266059292] [2019-11-15 23:14:31,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:14:31,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:14:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:31,135 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-11-15 23:14:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:31,227 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2019-11-15 23:14:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:31,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-11-15 23:14:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:31,230 INFO L225 Difference]: With dead ends: 108 [2019-11-15 23:14:31,230 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 23:14:31,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:14:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 23:14:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-15 23:14:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:14:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-11-15 23:14:31,234 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 59 [2019-11-15 23:14:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:31,234 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-11-15 23:14:31,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:14:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-11-15 23:14:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:14:31,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:31,235 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:31,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:31,441 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279415, now seen corresponding path program 2 times [2019-11-15 23:14:31,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:31,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227180918] [2019-11-15 23:14:31,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:14:31,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227180918] [2019-11-15 23:14:31,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:31,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:14:31,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067184874] [2019-11-15 23:14:31,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:14:31,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:31,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:14:31,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:14:31,597 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 9 states. [2019-11-15 23:14:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:31,989 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-11-15 23:14:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:14:31,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-15 23:14:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:31,990 INFO L225 Difference]: With dead ends: 141 [2019-11-15 23:14:31,990 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 23:14:31,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:14:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 23:14:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2019-11-15 23:14:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:14:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2019-11-15 23:14:31,994 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 66 [2019-11-15 23:14:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:31,995 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2019-11-15 23:14:31,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:14:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2019-11-15 23:14:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:14:31,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:31,996 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:31,996 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279470, now seen corresponding path program 1 times [2019-11-15 23:14:31,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:31,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568597820] [2019-11-15 23:14:31,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 23:14:32,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568597820] [2019-11-15 23:14:32,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:32,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:14:32,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655163086] [2019-11-15 23:14:32,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:14:32,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:32,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:14:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:14:32,320 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 16 states. [2019-11-15 23:14:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:33,005 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2019-11-15 23:14:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:14:33,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-11-15 23:14:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:33,007 INFO L225 Difference]: With dead ends: 142 [2019-11-15 23:14:33,007 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 23:14:33,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:14:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 23:14:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2019-11-15 23:14:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:14:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2019-11-15 23:14:33,013 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 66 [2019-11-15 23:14:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:33,013 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2019-11-15 23:14:33,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:14:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2019-11-15 23:14:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:14:33,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:33,014 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:33,014 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746546, now seen corresponding path program 1 times [2019-11-15 23:14:33,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:33,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357571044] [2019-11-15 23:14:33,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:33,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:33,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:14:34,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357571044] [2019-11-15 23:14:34,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666150584] [2019-11-15 23:14:34,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:34,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-15 23:14:34,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:34,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:34,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:14:34,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:34,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 23:14:34,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:14:34,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:34,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-15 23:14:34,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:14:34,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:34,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:34,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-15 23:14:34,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:34,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 23:14:34,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,522 INFO L567 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-11-15 23:14:34,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:34,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-11-15 23:14:34,608 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-15 23:14:34,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2019-11-15 23:14:34,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:34,623 INFO L567 ElimStorePlain]: treesize reduction 50, result has 41.2 percent of original size [2019-11-15 23:14:34,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:34,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-11-15 23:14:36,485 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 23:14:36,613 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-15 23:14:36,613 INFO L341 Elim1Store]: treesize reduction 10, result has 94.2 percent of original size [2019-11-15 23:14:36,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 195 [2019-11-15 23:14:36,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:36,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:36,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:14:36,732 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2019-11-15 23:14:36,733 INFO L567 ElimStorePlain]: treesize reduction 292, result has 30.0 percent of original size [2019-11-15 23:14:36,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:14:36,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:106 [2019-11-15 23:14:36,863 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:14:36,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 13 [2019-11-15 23:14:36,864 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:36,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:36,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:36,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:9 [2019-11-15 23:14:51,394 WARN L191 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:14:51,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:51,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:51,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:14:51,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:51,410 INFO L375 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 1 case distinctions, treesize of input 54 treesize of output 29 [2019-11-15 23:14:51,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:51,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:51,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:51,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-11-15 23:14:51,589 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:14:51,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2019-11-15 23:14:51,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:51,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:51,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:51,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-11-15 23:14:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:14:51,607 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:51,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 53 [2019-11-15 23:14:51,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600502766] [2019-11-15 23:14:51,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-15 23:14:51,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-15 23:14:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2699, Unknown=18, NotChecked=0, Total=2862 [2019-11-15 23:14:51,610 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 54 states. [2019-11-15 23:14:54,101 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 23:14:56,207 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:14:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:58,042 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-15 23:14:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:14:58,043 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2019-11-15 23:14:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:58,044 INFO L225 Difference]: With dead ends: 154 [2019-11-15 23:14:58,044 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:14:58,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=459, Invalid=5843, Unknown=18, NotChecked=0, Total=6320 [2019-11-15 23:14:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:14:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2019-11-15 23:14:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:14:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-11-15 23:14:58,049 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 69 [2019-11-15 23:14:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:58,049 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-11-15 23:14:58,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-15 23:14:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-11-15 23:14:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:14:58,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:58,050 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:58,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:58,254 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:14:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746545, now seen corresponding path program 1 times [2019-11-15 23:14:58,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:58,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288471402] [2019-11-15 23:14:58,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:58,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:58,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:14:59,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288471402] [2019-11-15 23:14:59,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913472686] [2019-11-15 23:14:59,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-15 23:14:59,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:59,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:59,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:14:59,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:59,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:59,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:59,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 23:14:59,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:14:59,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:59,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:59,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:14:59,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-15 23:14:59,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:14:59,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:14:59,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:14:59,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:14:59,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-15 23:15:00,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:00,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 23:15:00,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:00,058 INFO L567 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-11-15 23:15:00,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:00,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-15 23:15:02,111 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 23:15:02,113 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_35|], 12=[|v_#memory_$Pointer$.base_48|]} [2019-11-15 23:15:02,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:15:02,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:02,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:02,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:02,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:02,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 144 [2019-11-15 23:15:02,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:02,217 INFO L567 ElimStorePlain]: treesize reduction 160, result has 27.6 percent of original size [2019-11-15 23:15:02,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:02,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:58 [2019-11-15 23:15:04,285 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:15:06,349 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:15:08,416 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:15:10,483 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:15:10,810 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_33|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-11-15 23:15:10,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:10,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:10,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 103 [2019-11-15 23:15:10,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:10,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:10,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:11,025 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 23:15:11,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:11,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 390 [2019-11-15 23:15:11,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:11,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:11,091 INFO L567 ElimStorePlain]: treesize reduction 324, result has 25.7 percent of original size [2019-11-15 23:15:11,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:11,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:85 [2019-11-15 23:15:11,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:11,172 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-11-15 23:15:11,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:11,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2019-11-15 23:15:11,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:11,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:11,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2019-11-15 23:15:11,182 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:11,210 INFO L567 ElimStorePlain]: treesize reduction 55, result has 42.7 percent of original size [2019-11-15 23:15:11,213 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:15:11,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 13 [2019-11-15 23:15:11,214 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:11,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:11,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:11,227 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:12 [2019-11-15 23:15:12,465 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) (exists ((v_arrayElimCell_73 Int)) (<= 4 (select |c_#length| v_arrayElimCell_73)))) is different from true [2019-11-15 23:15:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:12,472 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_34|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-11-15 23:15:12,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,490 INFO L375 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 111 treesize of output 90 [2019-11-15 23:15:12,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:12,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,502 INFO L375 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 115 treesize of output 98 [2019-11-15 23:15:12,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:12,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:12,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,559 INFO L375 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 94 treesize of output 69 [2019-11-15 23:15:12,560 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:12,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,636 INFO L341 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2019-11-15 23:15:12,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 125 [2019-11-15 23:15:12,638 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:12,708 INFO L567 ElimStorePlain]: treesize reduction 82, result has 65.1 percent of original size [2019-11-15 23:15:12,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:15:12,709 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:227, output treesize:147 [2019-11-15 23:15:12,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:12,954 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-15 23:15:12,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2019-11-15 23:15:12,967 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:12,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:12,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2019-11-15 23:15:12,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:13,005 INFO L567 ElimStorePlain]: treesize reduction 63, result has 43.8 percent of original size [2019-11-15 23:15:13,013 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:15:13,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2019-11-15 23:15:13,014 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:13,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:13,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:13,021 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:163, output treesize:13 [2019-11-15 23:15:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-11-15 23:15:13,050 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:15:13,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 56 [2019-11-15 23:15:13,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730554026] [2019-11-15 23:15:13,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-15 23:15:13,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-15 23:15:13,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2935, Unknown=1, NotChecked=108, Total=3192 [2019-11-15 23:15:13,052 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 57 states. [2019-11-15 23:15:20,153 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-15 23:15:24,302 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-11-15 23:15:32,442 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-15 23:15:36,577 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-15 23:15:40,652 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-15 23:15:45,529 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-15 23:15:46,114 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-15 23:15:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:47,549 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-11-15 23:15:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:15:47,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 69 [2019-11-15 23:15:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:47,550 INFO L225 Difference]: With dead ends: 151 [2019-11-15 23:15:47,551 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 23:15:47,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=456, Invalid=6687, Unknown=1, NotChecked=166, Total=7310 [2019-11-15 23:15:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 23:15:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2019-11-15 23:15:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:15:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-11-15 23:15:47,556 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 69 [2019-11-15 23:15:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:47,557 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-11-15 23:15:47,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-15 23:15:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-11-15 23:15:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:15:47,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:47,558 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:47,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:47,762 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:15:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746490, now seen corresponding path program 1 times [2019-11-15 23:15:47,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:47,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834701791] [2019-11-15 23:15:47,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:47,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:47,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:15:47,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834701791] [2019-11-15 23:15:47,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:47,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:15:47,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685254927] [2019-11-15 23:15:47,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:15:47,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:15:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:15:47,878 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 10 states. [2019-11-15 23:15:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:48,253 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-11-15 23:15:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:15:48,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-11-15 23:15:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:48,254 INFO L225 Difference]: With dead ends: 130 [2019-11-15 23:15:48,254 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 23:15:48,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:15:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 23:15:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2019-11-15 23:15:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:15:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-11-15 23:15:48,257 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 69 [2019-11-15 23:15:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:48,258 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-11-15 23:15:48,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:15:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-11-15 23:15:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:15:48,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:48,259 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:48,259 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:15:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 493143767, now seen corresponding path program 1 times [2019-11-15 23:15:48,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:48,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263572434] [2019-11-15 23:15:48,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:48,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:48,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:15:48,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263572434] [2019-11-15 23:15:48,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:48,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:15:48,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92167362] [2019-11-15 23:15:48,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:15:48,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:48,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:15:48,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:15:48,542 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 15 states. [2019-11-15 23:15:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:49,329 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-11-15 23:15:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:15:49,330 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-11-15 23:15:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:49,330 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:15:49,331 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 23:15:49,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:15:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 23:15:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-11-15 23:15:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:15:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-15 23:15:49,333 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 91 [2019-11-15 23:15:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:49,334 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-15 23:15:49,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:15:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-15 23:15:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:15:49,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:49,335 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:49,335 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:15:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash 493143768, now seen corresponding path program 1 times [2019-11-15 23:15:49,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:49,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136628845] [2019-11-15 23:15:49,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:49,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:49,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:15:49,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136628845] [2019-11-15 23:15:49,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:49,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:15:49,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443182637] [2019-11-15 23:15:49,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:15:49,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:15:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:15:49,704 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 16 states. [2019-11-15 23:15:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:50,355 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-11-15 23:15:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:15:50,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-11-15 23:15:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:50,356 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:15:50,356 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:15:50,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:15:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:15:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2019-11-15 23:15:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:15:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-15 23:15:50,360 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 91 [2019-11-15 23:15:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:50,361 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-15 23:15:50,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:15:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-15 23:15:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:15:50,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:50,362 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:50,362 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:15:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028533, now seen corresponding path program 1 times [2019-11-15 23:15:50,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:50,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005924978] [2019-11-15 23:15:50,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:50,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:50,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:15:50,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005924978] [2019-11-15 23:15:50,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970772427] [2019-11-15 23:15:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:50,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 23:15:50,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:15:50,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:15:50,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:50,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:50,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:50,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-15 23:15:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 23:15:50,824 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:15:50,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-15 23:15:50,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176926038] [2019-11-15 23:15:50,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:15:50,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:15:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:15:50,826 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 15 states. [2019-11-15 23:15:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:51,672 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-15 23:15:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:15:51,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-11-15 23:15:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:51,673 INFO L225 Difference]: With dead ends: 129 [2019-11-15 23:15:51,673 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 23:15:51,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:15:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 23:15:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2019-11-15 23:15:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:15:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-11-15 23:15:51,676 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 94 [2019-11-15 23:15:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:51,676 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-11-15 23:15:51,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:15:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-11-15 23:15:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:15:51,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:51,677 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:51,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:51,878 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:15:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028532, now seen corresponding path program 1 times [2019-11-15 23:15:51,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:51,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770025368] [2019-11-15 23:15:51,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:51,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:51,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:15:53,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770025368] [2019-11-15 23:15:53,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009786464] [2019-11-15 23:15:53,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:53,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 125 conjunts are in the unsatisfiable core [2019-11-15 23:15:53,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:15:53,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:15:53,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 23:15:53,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:15:53,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:15:53,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2019-11-15 23:15:53,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:15:53,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:15:53,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:53,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-15 23:15:53,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:53,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:53,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 102 [2019-11-15 23:15:53,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,007 INFO L567 ElimStorePlain]: treesize reduction 52, result has 58.4 percent of original size [2019-11-15 23:15:54,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:54,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 60 [2019-11-15 23:15:54,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,050 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2019-11-15 23:15:54,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:53 [2019-11-15 23:15:54,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:54,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:54,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2019-11-15 23:15:54,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,173 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.3 percent of original size [2019-11-15 23:15:54,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:54,177 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:15:54,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:54,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 122 [2019-11-15 23:15:54,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,250 INFO L567 ElimStorePlain]: treesize reduction 96, result has 47.8 percent of original size [2019-11-15 23:15:54,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:15:54,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:91 [2019-11-15 23:15:55,495 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-15 23:15:55,501 INFO L392 ElimStorePlain]: Different costs {12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_43|], 20=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43|]} [2019-11-15 23:15:55,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:55,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:15:55,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:55,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 116 [2019-11-15 23:15:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,532 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:55,558 INFO L567 ElimStorePlain]: treesize reduction 38, result has 60.0 percent of original size [2019-11-15 23:15:55,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:55,587 INFO L341 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2019-11-15 23:15:55,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 63 [2019-11-15 23:15:55,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:55,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:55,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:15:55,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:80 [2019-11-15 23:15:55,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:58,452 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-11-15 23:15:58,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:15:58,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,476 INFO L375 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 45 treesize of output 32 [2019-11-15 23:15:58,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:58,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2019-11-15 23:15:58,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:58,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:15:58,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2019-11-15 23:15:58,517 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:15:58,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:15:58,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-15 23:15:58,561 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:146, output treesize:80 [2019-11-15 23:15:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:00,039 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 23:16:00,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:00,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:02,732 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2019-11-15 23:16:05,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:05,068 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 20=[|#memory_$Pointer$.offset|]} [2019-11-15 23:16:05,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-15 23:16:05,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2019-11-15 23:16:05,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2019-11-15 23:16:05,081 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:16:05,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 27 [2019-11-15 23:16:05,125 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:16:05,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2019-11-15 23:16:05,133 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:16:05,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2019-11-15 23:16:05,137 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,174 INFO L567 ElimStorePlain]: treesize reduction 19, result has 60.4 percent of original size [2019-11-15 23:16:05,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:16:05,174 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:188, output treesize:9 [2019-11-15 23:16:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 1 times theorem prover too weak. 5 trivial. 2 not checked. [2019-11-15 23:16:05,254 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:16:05,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41] total 68 [2019-11-15 23:16:05,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760443682] [2019-11-15 23:16:05,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 23:16:05,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 23:16:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4189, Unknown=4, NotChecked=262, Total=4692 [2019-11-15 23:16:05,257 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 69 states. [2019-11-15 23:16:06,913 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-11-15 23:16:13,114 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-11-15 23:16:18,828 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-11-15 23:16:19,583 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-11-15 23:16:20,095 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-11-15 23:16:26,286 WARN L191 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-11-15 23:16:26,931 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2019-11-15 23:16:29,280 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 146 DAG size of output: 97 [2019-11-15 23:16:29,645 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-11-15 23:16:29,914 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2019-11-15 23:16:44,609 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 23:16:44,927 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 23:16:45,218 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 23:16:51,426 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 23:16:53,855 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 23:16:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:59,891 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-15 23:16:59,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-15 23:16:59,891 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 94 [2019-11-15 23:16:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:59,893 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:16:59,893 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:16:59,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=702, Invalid=8613, Unknown=5, NotChecked=382, Total=9702 [2019-11-15 23:16:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:16:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-15 23:16:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:16:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-11-15 23:16:59,901 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 94 [2019-11-15 23:16:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:59,901 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-11-15 23:16:59,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 23:16:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-11-15 23:16:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:16:59,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:59,903 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:17:00,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:17:00,104 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:17:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:17:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1804537762, now seen corresponding path program 1 times [2019-11-15 23:17:00,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:17:00,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733084202] [2019-11-15 23:17:00,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:00,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:00,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:17:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:17:00,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733084202] [2019-11-15 23:17:00,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:17:00,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 23:17:00,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873437970] [2019-11-15 23:17:00,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:17:00,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:17:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:17:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:17:00,454 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 16 states. [2019-11-15 23:17:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:17:01,265 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-11-15 23:17:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:17:01,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-11-15 23:17:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:17:01,267 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:17:01,267 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:17:01,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:17:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:17:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-11-15 23:17:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:17:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-11-15 23:17:01,271 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 94 [2019-11-15 23:17:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:17:01,271 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-11-15 23:17:01,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:17:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-11-15 23:17:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:17:01,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:17:01,272 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:17:01,273 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:17:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:17:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1113311010, now seen corresponding path program 1 times [2019-11-15 23:17:01,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:17:01,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696444807] [2019-11-15 23:17:01,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:01,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:01,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:17:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:17:01,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696444807] [2019-11-15 23:17:01,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:17:01,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:17:01,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454743516] [2019-11-15 23:17:01,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:17:01,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:17:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:17:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:17:01,565 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 15 states. [2019-11-15 23:17:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:17:02,379 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-11-15 23:17:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:17:02,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-11-15 23:17:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:17:02,381 INFO L225 Difference]: With dead ends: 116 [2019-11-15 23:17:02,381 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 23:17:02,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:17:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 23:17:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2019-11-15 23:17:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:17:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-11-15 23:17:02,385 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 95 [2019-11-15 23:17:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:17:02,386 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-11-15 23:17:02,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:17:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-11-15 23:17:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:17:02,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:17:02,387 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:17:02,387 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:17:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:17:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -443599901, now seen corresponding path program 1 times [2019-11-15 23:17:02,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:17:02,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892245204] [2019-11-15 23:17:02,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:02,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:02,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:17:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:17:03,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892245204] [2019-11-15 23:17:03,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593339702] [2019-11-15 23:17:03,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:17:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:03,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-15 23:17:03,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:17:04,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:17:04,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:17:04,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:17:04,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-11-15 23:17:04,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:17:04,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:17:04,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:17:04,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:04,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-15 23:17:04,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:04,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 23:17:04,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,484 INFO L567 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-11-15 23:17:04,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:04,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-15 23:17:04,586 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-15 23:17:04,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-11-15 23:17:04,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,608 INFO L567 ElimStorePlain]: treesize reduction 50, result has 46.8 percent of original size [2019-11-15 23:17:04,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:04,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-11-15 23:17:04,943 INFO L341 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-11-15 23:17:04,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-11-15 23:17:04,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:04,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:04,945 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:04,959 INFO L567 ElimStorePlain]: treesize reduction 30, result has 30.2 percent of original size [2019-11-15 23:17:04,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:04,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-11-15 23:17:06,275 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-11-15 23:17:06,397 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-15 23:17:06,397 INFO L341 Elim1Store]: treesize reduction 10, result has 94.2 percent of original size [2019-11-15 23:17:06,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 195 [2019-11-15 23:17:06,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:06,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:06,432 INFO L567 ElimStorePlain]: treesize reduction 182, result has 24.2 percent of original size [2019-11-15 23:17:06,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:06,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:35 [2019-11-15 23:17:06,497 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:17:06,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 13 [2019-11-15 23:17:06,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:06,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:06,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:06,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-11-15 23:17:07,434 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-11-15 23:17:07,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:07,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:07,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:07,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:07,442 INFO L375 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 1 case distinctions, treesize of input 54 treesize of output 29 [2019-11-15 23:17:07,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:07,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:07,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:07,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:35 [2019-11-15 23:17:10,147 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:17:10,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2019-11-15 23:17:10,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:17:10,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:10,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:10,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-11-15 23:17:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-11-15 23:17:10,193 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:17:10,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 55 [2019-11-15 23:17:10,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734869289] [2019-11-15 23:17:10,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-15 23:17:10,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:17:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-15 23:17:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2704, Unknown=2, NotChecked=210, Total=3080 [2019-11-15 23:17:10,195 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 56 states. [2019-11-15 23:17:17,692 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-15 23:17:20,241 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-15 23:17:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:17:21,697 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-11-15 23:17:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:17:21,697 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 97 [2019-11-15 23:17:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:17:21,698 INFO L225 Difference]: With dead ends: 121 [2019-11-15 23:17:21,698 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 23:17:21,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=488, Invalid=5998, Unknown=2, NotChecked=318, Total=6806 [2019-11-15 23:17:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 23:17:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-11-15 23:17:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:17:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-11-15 23:17:21,703 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 97 [2019-11-15 23:17:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:17:21,704 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-11-15 23:17:21,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-15 23:17:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-11-15 23:17:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 23:17:21,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:17:21,705 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:17:21,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:17:21,912 INFO L410 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:17:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:17:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1064083314, now seen corresponding path program 1 times [2019-11-15 23:17:21,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:17:21,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708159487] [2019-11-15 23:17:21,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:21,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:17:21,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:17:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 23:17:23,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708159487] [2019-11-15 23:17:23,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860495578] [2019-11-15 23:17:23,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:17:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:17:23,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 101 conjunts are in the unsatisfiable core [2019-11-15 23:17:23,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:17:23,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:17:23,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:17:23,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:17:23,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 23:17:23,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:17:23,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:23,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-11-15 23:17:23,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 23:17:23,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,705 INFO L567 ElimStorePlain]: treesize reduction 22, result has 60.7 percent of original size [2019-11-15 23:17:23,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:23,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-11-15 23:17:23,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:23,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:23,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 84 [2019-11-15 23:17:23,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:23,810 INFO L567 ElimStorePlain]: treesize reduction 72, result has 36.3 percent of original size [2019-11-15 23:17:23,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:17:23,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2019-11-15 23:17:25,771 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-11-15 23:17:25,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:25,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:25,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 190 [2019-11-15 23:17:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:17:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:17:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:17:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:17:25,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-15 23:17:25,939 INFO L567 ElimStorePlain]: treesize reduction 1389, result has 3.7 percent of original size [2019-11-15 23:17:25,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:25,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:30 [2019-11-15 23:17:26,828 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-11-15 23:17:26,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:26,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:26,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:17:26,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:26,839 INFO L375 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 1 case distinctions, treesize of input 43 treesize of output 24 [2019-11-15 23:17:26,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:17:26,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:17:26,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:17:26,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:30 [2019-11-15 23:17:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2019-11-15 23:17:39,624 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:17:39,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 57 [2019-11-15 23:17:39,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751480471] [2019-11-15 23:17:39,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-15 23:17:39,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:17:39,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-15 23:17:39,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2793, Unknown=2, NotChecked=214, Total=3192 [2019-11-15 23:17:39,626 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 57 states. [2019-11-15 23:18:04,008 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-15 23:18:12,300 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-15 23:18:15,598 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:18:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,311 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-11-15 23:18:16,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:18:16,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 100 [2019-11-15 23:18:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,313 INFO L225 Difference]: With dead ends: 117 [2019-11-15 23:18:16,313 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 23:18:16,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=471, Invalid=5385, Unknown=4, NotChecked=302, Total=6162 [2019-11-15 23:18:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 23:18:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-15 23:18:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:18:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-11-15 23:18:16,317 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 100 [2019-11-15 23:18:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-11-15 23:18:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-15 23:18:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-11-15 23:18:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 23:18:16,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,319 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:16,526 INFO L410 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,527 INFO L82 PathProgramCache]: Analyzing trace with hash 329925328, now seen corresponding path program 1 times [2019-11-15 23:18:16,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364286201] [2019-11-15 23:18:16,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:18:18,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364286201] [2019-11-15 23:18:18,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703475575] [2019-11-15 23:18:18,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 136 conjunts are in the unsatisfiable core [2019-11-15 23:18:18,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:18,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:18,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:18:18,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:18,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:18,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:18,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-11-15 23:18:18,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:18:18,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:18,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:18,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:18,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-15 23:18:19,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:18:19,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-15 23:18:19,186 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_44|], 4=[|v_#memory_$Pointer$.base_69|]} [2019-11-15 23:18:19,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:18:19,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 51 [2019-11-15 23:18:19,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,247 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 23:18:19,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 23:18:19,323 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|], 7=[|v_#memory_$Pointer$.base_70|]} [2019-11-15 23:18:19,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-15 23:18:19,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:19,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:18:19,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 75 [2019-11-15 23:18:19,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,393 INFO L567 ElimStorePlain]: treesize reduction 70, result has 51.7 percent of original size [2019-11-15 23:18:19,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:75 [2019-11-15 23:18:21,839 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2019-11-15 23:18:21,842 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_BEFORE_CALL_11|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_58|]} [2019-11-15 23:18:21,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:18:21,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:21,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 69 [2019-11-15 23:18:21,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:21,911 INFO L567 ElimStorePlain]: treesize reduction 28, result has 79.3 percent of original size [2019-11-15 23:18:21,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:21,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 90 treesize of output 228 [2019-11-15 23:18:21,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:18:21,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:21,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:21,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:18:22,077 INFO L567 ElimStorePlain]: treesize reduction 472, result has 15.9 percent of original size [2019-11-15 23:18:22,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:22,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:22,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:22,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:119 [2019-11-15 23:18:23,618 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-11-15 23:18:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:23,693 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_BEFORE_CALL_13|], 15=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_59|]} [2019-11-15 23:18:23,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,710 INFO L375 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 91 treesize of output 78 [2019-11-15 23:18:23,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 96 [2019-11-15 23:18:23,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 91 [2019-11-15 23:18:23,751 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,899 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 23:18:23,900 INFO L567 ElimStorePlain]: treesize reduction 24, result has 90.7 percent of original size [2019-11-15 23:18:23,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 68 [2019-11-15 23:18:23,926 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 65 [2019-11-15 23:18:23,987 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:23,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:24,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:24,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 81 [2019-11-15 23:18:24,016 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:24,197 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-15 23:18:24,198 INFO L567 ElimStorePlain]: treesize reduction 64, result has 73.3 percent of original size [2019-11-15 23:18:24,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 23:18:24,198 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:290, output treesize:167 [2019-11-15 23:18:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:25,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:25,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,466 INFO L392 ElimStorePlain]: Different costs {15=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-15 23:18:27,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:27,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:18:27,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:18:27,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:27,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2019-11-15 23:18:27,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:27,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:27,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:18:27,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:27,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2019-11-15 23:18:27,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:27,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:27,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2019-11-15 23:18:27,510 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:27,566 INFO L567 ElimStorePlain]: treesize reduction 115, result has 36.8 percent of original size [2019-11-15 23:18:27,661 INFO L341 Elim1Store]: treesize reduction 8, result has 90.9 percent of original size [2019-11-15 23:18:27,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 102 [2019-11-15 23:18:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,664 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:27,706 INFO L567 ElimStorePlain]: treesize reduction 36, result has 49.3 percent of original size [2019-11-15 23:18:27,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:27,706 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:271, output treesize:31 [2019-11-15 23:18:27,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:27,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-11-15 23:18:28,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:28,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 62 [2019-11-15 23:18:28,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685711818] [2019-11-15 23:18:28,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-15 23:18:28,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-15 23:18:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3370, Unknown=2, NotChecked=234, Total=3782 [2019-11-15 23:18:28,096 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2019-11-15 23:18:29,865 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-11-15 23:18:30,805 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-15 23:18:34,406 WARN L191 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-11-15 23:18:37,708 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-11-15 23:18:38,827 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-15 23:18:39,059 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-15 23:18:39,418 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 108 [2019-11-15 23:18:39,722 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2019-11-15 23:18:40,073 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-11-15 23:18:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:40,297 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-11-15 23:18:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:18:40,297 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-11-15 23:18:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:40,298 INFO L225 Difference]: With dead ends: 103 [2019-11-15 23:18:40,298 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 23:18:40,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 68 SyntacticMatches, 23 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=506, Invalid=6640, Unknown=2, NotChecked=334, Total=7482 [2019-11-15 23:18:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 23:18:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-15 23:18:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 23:18:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-11-15 23:18:40,302 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 100 [2019-11-15 23:18:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:40,302 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-11-15 23:18:40,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-15 23:18:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-11-15 23:18:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 23:18:40,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:40,303 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:40,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:40,510 INFO L410 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:18:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash -769380864, now seen corresponding path program 1 times [2019-11-15 23:18:40,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:40,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43719743] [2019-11-15 23:18:40,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:40,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:18:41,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43719743] [2019-11-15 23:18:41,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498079988] [2019-11-15 23:18:41,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:41,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:18:41,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:42,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:42,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:42,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2019-11-15 23:18:42,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:42,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:42,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 34 [2019-11-15 23:18:42,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:42,182 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-11-15 23:18:42,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:18:42,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-11-15 23:18:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:18:42,320 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:42,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7] total 42 [2019-11-15 23:18:42,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639029034] [2019-11-15 23:18:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 23:18:42,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 23:18:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:18:42,322 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 43 states. [2019-11-15 23:18:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:44,801 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2019-11-15 23:18:44,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:18:44,801 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 102 [2019-11-15 23:18:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:44,802 INFO L225 Difference]: With dead ends: 102 [2019-11-15 23:18:44,802 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 23:18:44,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=335, Invalid=3571, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 23:18:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 23:18:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-15 23:18:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:18:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-11-15 23:18:44,805 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 102 [2019-11-15 23:18:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:44,806 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-11-15 23:18:44,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 23:18:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-11-15 23:18:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:18:44,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:44,807 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:45,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:45,011 INFO L410 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-11-15 23:18:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1463468233, now seen corresponding path program 1 times [2019-11-15 23:18:45,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:45,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253154788] [2019-11-15 23:18:45,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:45,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:45,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 23:18:46,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253154788] [2019-11-15 23:18:46,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114973766] [2019-11-15 23:18:46,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 109 conjunts are in the unsatisfiable core [2019-11-15 23:18:47,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:47,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:47,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 63 [2019-11-15 23:18:47,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,311 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-15 23:18:47,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2019-11-15 23:18:47,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:18:47,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:47,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-15 23:18:47,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:18:47,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:47,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:47,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2019-11-15 23:18:47,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:47,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 23:18:47,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:47,799 INFO L567 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-11-15 23:18:47,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:47,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-11-15 23:18:47,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:47,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:47,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 94 [2019-11-15 23:18:47,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:48,027 INFO L567 ElimStorePlain]: treesize reduction 72, result has 48.9 percent of original size [2019-11-15 23:18:48,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:48,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2019-11-15 23:18:48,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:18:48,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:48,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:48,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:18:48,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:48,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2019-11-15 23:18:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:48,671 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:48,717 INFO L567 ElimStorePlain]: treesize reduction 30, result has 44.4 percent of original size [2019-11-15 23:18:48,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:48,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2019-11-15 23:19:03,278 WARN L191 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 23:19:03,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:03,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:03,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 200 [2019-11-15 23:19:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:19:03,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:03,406 INFO L567 ElimStorePlain]: treesize reduction 182, result has 35.2 percent of original size [2019-11-15 23:19:03,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:03,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:114, output treesize:76 [2019-11-15 23:19:03,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 23:19:03,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:03,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:03,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:03,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-15 23:19:03,541 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:03,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:03,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:03,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:18 [2019-11-15 23:19:14,747 WARN L191 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 23:19:14,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:14,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:14,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:14,784 INFO L375 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 65 treesize of output 34 [2019-11-15 23:19:14,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:14,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:14,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:14,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:76 [2019-11-15 23:19:14,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 23:19:14,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:14,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:14,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:14,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-11-15 23:19:15,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 23:19:15,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:15,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:15,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:15,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-11-15 23:19:15,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 23:19:15,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:15,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:15,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 23:19:15,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:15,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:15,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:19:15,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:33 [2019-11-15 23:19:17,761 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 23:19:19,877 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 23:19:22,011 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 23:19:22,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:19:22,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 23:19:22,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:19:22,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:22,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:22,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:19:22,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:19:22,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:19:22,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:22,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 41 [2019-11-15 23:19:22,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:19:22,073 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:19:22,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:19:22,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:19:22,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 23:19:22,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:110, output treesize:51 [2019-11-15 23:19:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:19:22,301 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:19:22,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 66 [2019-11-15 23:19:22,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37562454] [2019-11-15 23:19:22,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-15 23:19:22,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:19:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-15 23:19:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4186, Unknown=20, NotChecked=0, Total=4422 [2019-11-15 23:19:22,303 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 67 states. [2019-11-15 23:19:38,139 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2019-11-15 23:19:48,591 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:19:58,778 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:20:08,531 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 23:20:12,731 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-11-15 23:20:16,976 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-11-15 23:20:21,191 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-11-15 23:20:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:20:21,233 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2019-11-15 23:20:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:20:21,233 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 106 [2019-11-15 23:20:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:20:21,234 INFO L225 Difference]: With dead ends: 101 [2019-11-15 23:20:21,234 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:20:21,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=512, Invalid=8022, Unknown=22, NotChecked=0, Total=8556 [2019-11-15 23:20:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:20:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:20:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:20:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:20:21,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-11-15 23:20:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:20:21,236 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:20:21,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-15 23:20:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:20:21,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:20:21,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:20:21,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:20:21 BoogieIcfgContainer [2019-11-15 23:20:21,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:20:21,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:20:21,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:20:21,444 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:20:21,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:02" (3/4) ... [2019-11-15 23:20:21,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:20:21,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:20:21,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-15 23:20:21,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-11-15 23:20:21,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-11-15 23:20:21,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-11-15 23:20:21,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-11-15 23:20:21,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-15 23:20:21,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:20:21,523 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_04fcc786-b7f7-4e3e-a026-3efc27f5273b/bin/uautomizer/witness.graphml [2019-11-15 23:20:21,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:20:21,525 INFO L168 Benchmark]: Toolchain (without parser) took 380528.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -351.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:20:21,525 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:20:21,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:20:21,526 INFO L168 Benchmark]: Boogie Preprocessor took 60.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:20:21,527 INFO L168 Benchmark]: RCFGBuilder took 704.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:20:21,527 INFO L168 Benchmark]: TraceAbstraction took 379194.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:20:21,527 INFO L168 Benchmark]: Witness Printer took 80.58 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:20:21,529 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 482.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 704.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 379194.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 80.58 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 120 locations, 33 error locations. Result: SAFE, OverallTime: 379.1s, OverallIterations: 38, TraceHistogramMax: 3, AutomataDifference: 239.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2426 SDtfs, 6748 SDslu, 11741 SDs, 0 SdLazy, 41717 SolverSat, 1599 SolverUnsat, 54 SolverUnknown, 0 SolverNotchecked, 124.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2535 GetRequests, 1276 SyntacticMatches, 83 SemanticMatches, 1176 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12550 ImplicationChecksByTransitivity, 232.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=25, 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, 38 MinimizatonAttempts, 663 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 131.5s InterpolantComputationTime, 3463 NumberOfCodeBlocks, 3463 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3407 ConstructedInterpolants, 273 QuantifiedInterpolants, 3910969 SizeOfPredicates, 276 NumberOfNonLiveVariables, 6022 ConjunctsInSsa, 1041 ConjunctsInUnsatCore, 56 InterpolantComputations, 21 PerfectInterpolantSequences, 750/1115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...