./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/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 ed4d18349810257ce078dfe4f08b9b953ed4516f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:42:48,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:42:48,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:42:48,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:42:48,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:42:48,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:42:48,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:42:48,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:42:48,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:42:48,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:42:48,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:42:48,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:42:48,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:42:48,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:42:48,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:42:48,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:42:48,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:42:48,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:42:48,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:42:48,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:42:48,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:42:48,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:42:48,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:42:48,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:42:48,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:42:48,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:42:48,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:42:48,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:42:48,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:42:48,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:42:48,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:42:48,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:42:48,067 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:42:48,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:42:48,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:42:48,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:42:48,068 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 12:42:48,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:42:48,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:42:48,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:42:48,079 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:42:48,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:42:48,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:42:48,080 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 12:42:48,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:42:48,081 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:42:48,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:42:48,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:42:48,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:42:48,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:42:48,083 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 12:42:48,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:42:48,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2018-12-02 12:42:48,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:42:48,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:42:48,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:42:48,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:42:48,114 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:42:48,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 12:42:48,147 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/data/43301d3ea/c689270264fb42ba9695859bdb92ad42/FLAG496368f06 [2018-12-02 12:42:48,590 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:42:48,590 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 12:42:48,596 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/data/43301d3ea/c689270264fb42ba9695859bdb92ad42/FLAG496368f06 [2018-12-02 12:42:48,605 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/data/43301d3ea/c689270264fb42ba9695859bdb92ad42 [2018-12-02 12:42:48,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:42:48,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 12:42:48,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:42:48,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:42:48,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:42:48,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b1aa1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48, skipping insertion in model container [2018-12-02 12:42:48,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:42:48,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:42:48,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:42:48,834 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:42:48,869 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:42:48,893 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:42:48,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48 WrapperNode [2018-12-02 12:42:48,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:42:48,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:42:48,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:42:48,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:42:48,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... [2018-12-02 12:42:48,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:42:48,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:42:48,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:42:48,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:42:48,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/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 [2018-12-02 12:42:48,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:42:48,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:42:48,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-02 12:42:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:42:48,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 12:42:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 12:42:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 12:42:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 12:42:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 12:42:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 12:42:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 12:42:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 12:42:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 12:42:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-02 12:42:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:42:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:42:49,257 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:42:49,258 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 12:42:49,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:42:49 BoogieIcfgContainer [2018-12-02 12:42:49,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:42:49,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:42:49,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:42:49,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:42:49,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:42:48" (1/3) ... [2018-12-02 12:42:49,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750a6d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:42:49, skipping insertion in model container [2018-12-02 12:42:49,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:48" (2/3) ... [2018-12-02 12:42:49,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750a6d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:42:49, skipping insertion in model container [2018-12-02 12:42:49,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:42:49" (3/3) ... [2018-12-02 12:42:49,264 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 12:42:49,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:42:49,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-02 12:42:49,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-02 12:42:49,299 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:42:49,299 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:42:49,299 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:42:49,299 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:42:49,300 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:42:49,300 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:42:49,300 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:42:49,300 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:42:49,300 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:42:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-12-02 12:42:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 12:42:49,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:49,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:42:49,319 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:49,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-12-02 12:42:49,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:49,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:49,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:49,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:42:49,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:42:49,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:42:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:42:49,435 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-12-02 12:42:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:49,505 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-12-02 12:42:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:42:49,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 12:42:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:49,513 INFO L225 Difference]: With dead ends: 106 [2018-12-02 12:42:49,513 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 12:42:49,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:42:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 12:42:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 12:42:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 12:42:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-02 12:42:49,539 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-12-02 12:42:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:49,540 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-02 12:42:49,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:42:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-02 12:42:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 12:42:49,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:49,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:42:49,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:49,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-12-02 12:42:49,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:49,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:49,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:49,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:49,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:49,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:42:49,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:42:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:42:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:42:49,580 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-12-02 12:42:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:49,625 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-02 12:42:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:42:49,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 12:42:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:49,626 INFO L225 Difference]: With dead ends: 96 [2018-12-02 12:42:49,626 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:42:49,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:42:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:42:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 12:42:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 12:42:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-02 12:42:49,634 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-12-02 12:42:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:49,634 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 12:42:49,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:42:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-02 12:42:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:42:49,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:49,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:42:49,636 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:49,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-12-02 12:42:49,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:49,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:49,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:42:49,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:42:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:42:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:42:49,695 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-02 12:42:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:49,725 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-02 12:42:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:42:49,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 12:42:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:49,727 INFO L225 Difference]: With dead ends: 97 [2018-12-02 12:42:49,727 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 12:42:49,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 12:42:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-02 12:42:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 12:42:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-12-02 12:42:49,734 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-12-02 12:42:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:49,735 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-12-02 12:42:49,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:42:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-12-02 12:42:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 12:42:49,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:49,736 INFO L402 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] [2018-12-02 12:42:49,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:49,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-12-02 12:42:49,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:49,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:49,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:42:49,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:42:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:42:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:49,816 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-12-02 12:42:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:49,923 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-12-02 12:42:49,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:49,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 12:42:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:49,925 INFO L225 Difference]: With dead ends: 97 [2018-12-02 12:42:49,926 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 12:42:49,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 12:42:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-02 12:42:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 12:42:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-02 12:42:49,930 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-12-02 12:42:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:49,930 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 12:42:49,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:42:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-02 12:42:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 12:42:49,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:49,931 INFO L402 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] [2018-12-02 12:42:49,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:49,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-12-02 12:42:49,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:42:49,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:49,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:42:49,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:42:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:42:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:49,976 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-12-02 12:42:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:50,075 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-02 12:42:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:50,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 12:42:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:50,076 INFO L225 Difference]: With dead ends: 96 [2018-12-02 12:42:50,076 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:42:50,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:42:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-12-02 12:42:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 12:42:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-12-02 12:42:50,081 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-12-02 12:42:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:50,082 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-12-02 12:42:50,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:42:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-12-02 12:42:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 12:42:50,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:50,083 INFO L402 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] [2018-12-02 12:42:50,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:50,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-12-02 12:42:50,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:50,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:50,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:50,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:50,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:50,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:50,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:51,578 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:42:51,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:51,582 INFO L267 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. [2018-12-02 12:42:51,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 12:42:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-02 12:42:51,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:42:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:42:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-02 12:42:51,606 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-12-02 12:42:51,911 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 12:42:52,248 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 12:42:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:52,498 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-02 12:42:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:42:52,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-02 12:42:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:52,500 INFO L225 Difference]: With dead ends: 132 [2018-12-02 12:42:52,500 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 12:42:52,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-12-02 12:42:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 12:42:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-02 12:42:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 12:42:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-12-02 12:42:52,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-12-02 12:42:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:52,505 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-12-02 12:42:52,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:42:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-12-02 12:42:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 12:42:52,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:52,506 INFO L402 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] [2018-12-02 12:42:52,506 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:52,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-12-02 12:42:52,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:52,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:52,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:52,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:52,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:52,644 INFO L478 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 [2018-12-02 12:42:52,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:52,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:52,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 12:42:52,904 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2018-12-02 12:42:52,911 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:42:52,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:52,918 INFO L267 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. [2018-12-02 12:42:52,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-02 12:42:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 12:42:52,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:52,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-02 12:42:52,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:42:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:42:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-12-02 12:42:52,951 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-12-02 12:42:53,466 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-02 12:42:53,989 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-02 12:42:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:54,176 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-02 12:42:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:42:54,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-02 12:42:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:54,177 INFO L225 Difference]: With dead ends: 101 [2018-12-02 12:42:54,177 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 12:42:54,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2018-12-02 12:42:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 12:42:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 12:42:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 12:42:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-02 12:42:54,181 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-12-02 12:42:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:54,182 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-02 12:42:54,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:42:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-02 12:42:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:42:54,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:54,183 INFO L402 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] [2018-12-02 12:42:54,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:54,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-12-02 12:42:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:54,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:54,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-12-02 12:42:54,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:42:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:42:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:42:54,280 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-12-02 12:42:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:54,327 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-12-02 12:42:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:54,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-02 12:42:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:54,327 INFO L225 Difference]: With dead ends: 101 [2018-12-02 12:42:54,328 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 12:42:54,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:42:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 12:42:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 12:42:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 12:42:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-12-02 12:42:54,330 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-12-02 12:42:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:54,330 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-12-02 12:42:54,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:42:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-12-02 12:42:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:42:54,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:54,331 INFO L402 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] [2018-12-02 12:42:54,331 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:54,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-12-02 12:42:54,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:54,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:54,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:54,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:54,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 12:42:54,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:42:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:42:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:42:54,472 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-12-02 12:42:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:54,563 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-02 12:42:54,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:42:54,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-02 12:42:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:54,564 INFO L225 Difference]: With dead ends: 111 [2018-12-02 12:42:54,564 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 12:42:54,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:42:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 12:42:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-02 12:42:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 12:42:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-02 12:42:54,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-12-02 12:42:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:54,566 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-02 12:42:54,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:42:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-02 12:42:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:42:54,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:54,567 INFO L402 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] [2018-12-02 12:42:54,567 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:54,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-12-02 12:42:54,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:54,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 12:42:54,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:54,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:54,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 12:42:54,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:54,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-02 12:42:54,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:42:54,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:42:54,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:42:54,667 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-12-02 12:42:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:54,729 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-02 12:42:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:54,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 12:42:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:54,730 INFO L225 Difference]: With dead ends: 104 [2018-12-02 12:42:54,730 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 12:42:54,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 12:42:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-02 12:42:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 12:42:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-02 12:42:54,734 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-12-02 12:42:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:54,734 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-02 12:42:54,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:42:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-02 12:42:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:42:54,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:54,735 INFO L402 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] [2018-12-02 12:42:54,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:54,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-12-02 12:42:54,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:54,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:42:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:42:54,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:42:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:42:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:54,772 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-12-02 12:42:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:54,885 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-02 12:42:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:42:54,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 12:42:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:54,885 INFO L225 Difference]: With dead ends: 103 [2018-12-02 12:42:54,885 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 12:42:54,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:42:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 12:42:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-02 12:42:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 12:42:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-02 12:42:54,888 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-12-02 12:42:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:54,889 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-02 12:42:54,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:42:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-02 12:42:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:42:54,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:54,889 INFO L402 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] [2018-12-02 12:42:54,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:54,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-12-02 12:42:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:54,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:54,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:42:54,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:42:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:42:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:54,943 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-02 12:42:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:55,042 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-02 12:42:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:42:55,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 12:42:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:55,043 INFO L225 Difference]: With dead ends: 101 [2018-12-02 12:42:55,043 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 12:42:55,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:42:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 12:42:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 12:42:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 12:42:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-12-02 12:42:55,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-12-02 12:42:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:55,045 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-12-02 12:42:55,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:42:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-12-02 12:42:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 12:42:55,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:55,045 INFO L402 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] [2018-12-02 12:42:55,046 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:55,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-12-02 12:42:55,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:55,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:55,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:42:55,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:55,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:42:55,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:42:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:42:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:42:55,107 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-12-02 12:42:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:55,330 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-02 12:42:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:42:55,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-02 12:42:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:55,331 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:42:55,331 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:42:55,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:42:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:42:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-02 12:42:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 12:42:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-12-02 12:42:55,334 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-12-02 12:42:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:55,334 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-12-02 12:42:55,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:42:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-12-02 12:42:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 12:42:55,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:55,335 INFO L402 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] [2018-12-02 12:42:55,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:55,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-12-02 12:42:55,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:55,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:55,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:42:55,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:42:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:42:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:42:55,447 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 12 states. [2018-12-02 12:42:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:55,656 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-02 12:42:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:42:55,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-02 12:42:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:55,657 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:42:55,657 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:42:55,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:42:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:42:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-02 12:42:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 12:42:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-12-02 12:42:55,660 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2018-12-02 12:42:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:55,660 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-12-02 12:42:55,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:42:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-12-02 12:42:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:42:55,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:55,661 INFO L402 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] [2018-12-02 12:42:55,662 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:55,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:55,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686117, now seen corresponding path program 1 times [2018-12-02 12:42:55,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:55,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:42:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:42:55,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:42:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:42:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:42:55,744 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 12 states. [2018-12-02 12:42:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:55,972 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-12-02 12:42:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:42:55,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-12-02 12:42:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:55,973 INFO L225 Difference]: With dead ends: 121 [2018-12-02 12:42:55,973 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 12:42:55,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:42:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 12:42:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-12-02 12:42:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 12:42:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-12-02 12:42:55,976 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 47 [2018-12-02 12:42:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:55,977 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-12-02 12:42:55,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:42:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-12-02 12:42:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:42:55,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:55,978 INFO L402 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] [2018-12-02 12:42:55,978 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:55,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686116, now seen corresponding path program 1 times [2018-12-02 12:42:55,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 12:42:56,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:56,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:42:56,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:42:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:42:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:42:56,001 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 4 states. [2018-12-02 12:42:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:56,019 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-12-02 12:42:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:42:56,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 12:42:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:56,020 INFO L225 Difference]: With dead ends: 114 [2018-12-02 12:42:56,020 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 12:42:56,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:42:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 12:42:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2018-12-02 12:42:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 12:42:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-12-02 12:42:56,022 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 47 [2018-12-02 12:42:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:56,022 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-12-02 12:42:56,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:42:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-12-02 12:42:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:42:56,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:56,023 INFO L402 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] [2018-12-02 12:42:56,023 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:56,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-12-02 12:42:56,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 12:42:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:42:56,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:42:56,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:42:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:56,050 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2018-12-02 12:42:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:56,075 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-02 12:42:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:56,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 12:42:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:56,076 INFO L225 Difference]: With dead ends: 96 [2018-12-02 12:42:56,076 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:42:56,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:42:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:42:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 12:42:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 12:42:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-12-02 12:42:56,078 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2018-12-02 12:42:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:56,078 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-12-02 12:42:56,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:42:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-12-02 12:42:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 12:42:56,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:56,079 INFO L402 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] [2018-12-02 12:42:56,079 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:56,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-12-02 12:42:56,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:56,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 12:42:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:56,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:42:56,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:42:56,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:42:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:42:56,102 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 5 states. [2018-12-02 12:42:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:56,128 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-12-02 12:42:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:42:56,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 12:42:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:56,129 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:42:56,129 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:42:56,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:42:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-12-02 12:42:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 12:42:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-12-02 12:42:56,131 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2018-12-02 12:42:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-12-02 12:42:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:42:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-12-02 12:42:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 12:42:56,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:56,132 INFO L402 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] [2018-12-02 12:42:56,132 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:56,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081466, now seen corresponding path program 1 times [2018-12-02 12:42:56,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:56,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:56,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:42:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:56,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:42:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:42:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:42:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:42:56,201 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-12-02 12:42:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:56,412 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-12-02 12:42:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:42:56,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-02 12:42:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:56,412 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:42:56,412 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:42:56,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:42:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:42:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-02 12:42:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 12:42:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-12-02 12:42:56,414 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2018-12-02 12:42:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:56,415 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-12-02 12:42:56,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:42:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-12-02 12:42:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 12:42:56,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:56,415 INFO L402 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] [2018-12-02 12:42:56,415 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:56,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081465, now seen corresponding path program 1 times [2018-12-02 12:42:56,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 12:42:56,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:56,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:56,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 12:42:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 12:42:56,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:42:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:42:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:42:56,512 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 7 states. [2018-12-02 12:42:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:56,547 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-12-02 12:42:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:42:56,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-02 12:42:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:42:56,548 INFO L225 Difference]: With dead ends: 118 [2018-12-02 12:42:56,548 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 12:42:56,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:42:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 12:42:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-12-02 12:42:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 12:42:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-02 12:42:56,550 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 55 [2018-12-02 12:42:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:42:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-02 12:42:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:42:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-02 12:42:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 12:42:56,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:42:56,551 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 12:42:56,551 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:42:56,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 186975810, now seen corresponding path program 1 times [2018-12-02 12:42:56,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:56,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:56,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:56,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:42:57,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:42:57,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:42:57,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 12:42:57,076 INFO L478 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 11 treesize of output 8 [2018-12-02 12:42:57,077 INFO L478 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 8 treesize of output 7 [2018-12-02 12:42:57,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 12:42:57,106 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 12:42:57,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-02 12:42:57,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,114 INFO L267 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. [2018-12-02 12:42:57,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 12:42:57,175 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 12:42:57,177 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 12:42:57,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:57,189 INFO L267 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. [2018-12-02 12:42:57,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-02 12:42:59,239 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-02 12:42:59,244 INFO L478 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 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-02 12:42:59,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:42:59,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-12-02 12:42:59,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:59,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:42:59,256 INFO L267 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. [2018-12-02 12:42:59,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-12-02 12:42:59,414 INFO L478 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 44 treesize of output 37 [2018-12-02 12:42:59,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:42:59,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 19 [2018-12-02 12:42:59,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:42:59,432 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 12:42:59,432 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:42:59,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:42:59,438 INFO L267 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. [2018-12-02 12:42:59,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2018-12-02 12:43:08,570 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 12:43:08,578 INFO L478 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 0 case distinctions, treesize of input 63 treesize of output 55 [2018-12-02 12:43:08,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:08,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:08,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:08,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-12-02 12:43:08,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,599 INFO L267 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. [2018-12-02 12:43:08,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:51 [2018-12-02 12:43:08,725 INFO L478 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 51 treesize of output 35 [2018-12-02 12:43:08,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:08,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 12:43:08,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,736 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 12:43:08,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:08,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-12-02 12:43:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:43:08,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:43:08,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 43 [2018-12-02 12:43:08,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 12:43:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 12:43:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1765, Unknown=19, NotChecked=0, Total=1892 [2018-12-02 12:43:08,776 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 44 states. [2018-12-02 12:43:19,905 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-02 12:43:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:43:27,005 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-12-02 12:43:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 12:43:27,006 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 56 [2018-12-02 12:43:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:43:27,006 INFO L225 Difference]: With dead ends: 178 [2018-12-02 12:43:27,006 INFO L226 Difference]: Without dead ends: 178 [2018-12-02 12:43:27,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=338, Invalid=4064, Unknown=20, NotChecked=0, Total=4422 [2018-12-02 12:43:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-02 12:43:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2018-12-02 12:43:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-02 12:43:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2018-12-02 12:43:27,011 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 56 [2018-12-02 12:43:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:43:27,011 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-12-02 12:43:27,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 12:43:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2018-12-02 12:43:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 12:43:27,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:43:27,012 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 12:43:27,012 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:43:27,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:43:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 186975811, now seen corresponding path program 1 times [2018-12-02 12:43:27,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:43:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:43:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:43:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:43:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:43:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:27,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:43:27,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:43:27,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:43:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:27,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:43:27,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:27,874 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:43:27,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:27,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:27,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:43:27,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-02 12:43:27,950 INFO L478 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 11 treesize of output 8 [2018-12-02 12:43:27,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:43:27,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,965 INFO L478 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 11 treesize of output 8 [2018-12-02 12:43:27,966 INFO L478 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 8 treesize of output 7 [2018-12-02 12:43:27,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:27,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-12-02 12:43:28,021 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 12:43:28,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-02 12:43:28,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,041 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-02 12:43:28,043 INFO L478 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 18 treesize of output 17 [2018-12-02 12:43:28,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2018-12-02 12:43:28,205 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-12-02 12:43:28,213 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-02 12:43:28,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,266 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 97 [2018-12-02 12:43:28,271 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 12:43:28,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:110 [2018-12-02 12:43:28,378 INFO L478 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 0 case distinctions, treesize of input 151 treesize of output 115 [2018-12-02 12:43:28,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:28,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 153 [2018-12-02 12:43:28,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,418 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 106 [2018-12-02 12:43:28,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:28,421 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 129 [2018-12-02 12:43:28,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:28,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:169, output treesize:173 [2018-12-02 12:43:28,706 INFO L478 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 168 treesize of output 115 [2018-12-02 12:43:28,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:28,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 61 treesize of output 49 [2018-12-02 12:43:28,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:28,730 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2018-12-02 12:43:28,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:28,750 INFO L478 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 55 treesize of output 45 [2018-12-02 12:43:28,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:28,754 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-12-02 12:43:28,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:28,762 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-02 12:43:28,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,766 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:28,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:28,771 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:179, output treesize:21 [2018-12-02 12:43:44,862 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 12:43:44,873 INFO L478 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 0 case distinctions, treesize of input 187 treesize of output 147 [2018-12-02 12:43:44,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 204 [2018-12-02 12:43:44,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:44,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:44,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,932 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 123 [2018-12-02 12:43:44,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:44,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 180 [2018-12-02 12:43:44,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:44,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:44,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:44,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:228, output treesize:199 [2018-12-02 12:43:45,190 INFO L478 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 175 treesize of output 113 [2018-12-02 12:43:45,192 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2018-12-02 12:43:45,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:45,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2018-12-02 12:43:45,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,227 INFO L478 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 62 treesize of output 50 [2018-12-02 12:43:45,230 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-02 12:43:45,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:43:45,238 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-12-02 12:43:45,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:43:45,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:43:45,247 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:187, output treesize:23 [2018-12-02 12:43:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:43:45,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:43:45,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2018-12-02 12:43:45,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 12:43:45,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 12:43:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2499, Unknown=16, NotChecked=0, Total=2652 [2018-12-02 12:43:45,366 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 52 states. [2018-12-02 12:43:59,790 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-12-02 12:44:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:11,817 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2018-12-02 12:44:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 12:44:11,818 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2018-12-02 12:44:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:11,818 INFO L225 Difference]: With dead ends: 256 [2018-12-02 12:44:11,818 INFO L226 Difference]: Without dead ends: 256 [2018-12-02 12:44:11,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=436, Invalid=6024, Unknown=20, NotChecked=0, Total=6480 [2018-12-02 12:44:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-02 12:44:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 141. [2018-12-02 12:44:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 12:44:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2018-12-02 12:44:11,823 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 56 [2018-12-02 12:44:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:11,823 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2018-12-02 12:44:11,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 12:44:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2018-12-02 12:44:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 12:44:11,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:11,823 INFO L402 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] [2018-12-02 12:44:11,824 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:11,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash -374568026, now seen corresponding path program 2 times [2018-12-02 12:44:11,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:11,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:11,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:11,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 12:44:11,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:11,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:11,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:44:11,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:44:11,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:44:11,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 12:44:11,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:11,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 12:44:11,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:44:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:44:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:44:11,936 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 7 states. [2018-12-02 12:44:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:11,969 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-12-02 12:44:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:44:11,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-02 12:44:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:11,970 INFO L225 Difference]: With dead ends: 122 [2018-12-02 12:44:11,970 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 12:44:11,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:44:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 12:44:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-02 12:44:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 12:44:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-02 12:44:11,974 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 59 [2018-12-02 12:44:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:11,974 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-02 12:44:11,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:44:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-02 12:44:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 12:44:11,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:11,975 INFO L402 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] [2018-12-02 12:44:11,975 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:11,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1825281605, now seen corresponding path program 2 times [2018-12-02 12:44:11,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:11,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:11,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:44:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:44:12,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:12,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:12,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:44:12,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 12:44:12,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:44:12,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 12:44:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 12:44:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2018-12-02 12:44:12,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 12:44:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 12:44:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-02 12:44:12,223 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 18 states. [2018-12-02 12:44:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:12,609 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-12-02 12:44:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:44:12,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-12-02 12:44:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:12,610 INFO L225 Difference]: With dead ends: 129 [2018-12-02 12:44:12,610 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 12:44:12,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-12-02 12:44:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 12:44:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-12-02 12:44:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 12:44:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-12-02 12:44:12,613 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 63 [2018-12-02 12:44:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:12,613 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-12-02 12:44:12,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 12:44:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-12-02 12:44:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 12:44:12,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:12,614 INFO L402 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] [2018-12-02 12:44:12,614 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:12,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 789761038, now seen corresponding path program 1 times [2018-12-02 12:44:12,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:12,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:12,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:44:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 12:44:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:44:12,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:44:12,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:44:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:44:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:44:12,644 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 5 states. [2018-12-02 12:44:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:12,665 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-12-02 12:44:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:44:12,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 12:44:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:12,666 INFO L225 Difference]: With dead ends: 131 [2018-12-02 12:44:12,666 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 12:44:12,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:44:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 12:44:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-02 12:44:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 12:44:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-12-02 12:44:12,670 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 66 [2018-12-02 12:44:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:12,670 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-12-02 12:44:12,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:44:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-12-02 12:44:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:44:12,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:12,671 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-12-02 12:44:12,671 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:12,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1443647666, now seen corresponding path program 3 times [2018-12-02 12:44:12,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:12,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:12,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 12:44:12,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:12,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:12,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:44:13,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:44:13,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:44:13,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:44:13,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:13,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-12-02 12:44:13,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:44:13,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:44:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:44:13,416 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 12 states. [2018-12-02 12:44:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:13,480 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-02 12:44:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:44:13,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-02 12:44:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:13,481 INFO L225 Difference]: With dead ends: 115 [2018-12-02 12:44:13,481 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 12:44:13,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-02 12:44:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 12:44:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-02 12:44:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 12:44:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-12-02 12:44:13,483 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 67 [2018-12-02 12:44:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:13,483 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-12-02 12:44:13,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:44:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-12-02 12:44:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 12:44:13,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:13,484 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 12:44:13,484 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:13,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash -719196084, now seen corresponding path program 1 times [2018-12-02 12:44:13,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:13,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:44:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 12:44:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:44:13,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:44:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:44:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:44:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:44:13,572 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 12 states. [2018-12-02 12:44:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:13,744 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-12-02 12:44:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:44:13,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-02 12:44:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:13,745 INFO L225 Difference]: With dead ends: 119 [2018-12-02 12:44:13,745 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 12:44:13,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:44:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 12:44:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-12-02 12:44:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 12:44:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-12-02 12:44:13,748 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 77 [2018-12-02 12:44:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:13,748 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-12-02 12:44:13,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:44:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-12-02 12:44:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:44:13,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:13,748 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 12:44:13,749 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:13,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319984, now seen corresponding path program 1 times [2018-12-02 12:44:13,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:44:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:14,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:14,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:14,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:14,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:14,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:44:14,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 12:44:14,362 INFO L478 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 11 treesize of output 8 [2018-12-02 12:44:14,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:44:14,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 12:44:14,394 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 12:44:14,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-02 12:44:14,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,401 INFO L267 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. [2018-12-02 12:44:14,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 12:44:14,458 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 12:44:14,460 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 12:44:14,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,469 INFO L267 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. [2018-12-02 12:44:14,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 12:44:14,502 INFO L478 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 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-02 12:44:14,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:14,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-12-02 12:44:14,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:14,512 INFO L267 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. [2018-12-02 12:44:14,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 12:44:15,088 WARN L854 $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 [2018-12-02 12:44:15,099 INFO L478 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-02 12:44:15,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:15,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:15,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:15,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-02 12:44:15,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:15,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:15,114 INFO L267 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. [2018-12-02 12:44:15,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-12-02 12:44:15,888 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 12:44:15,895 INFO L478 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 0 case distinctions, treesize of input 75 treesize of output 67 [2018-12-02 12:44:15,903 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 12:44:15,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:44:15,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:44:15,924 INFO L267 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. [2018-12-02 12:44:15,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-12-02 12:44:16,131 INFO L478 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 38 treesize of output 28 [2018-12-02 12:44:16,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:16,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 12:44:16,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:16,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:16,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:16,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-12-02 12:44:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2018-12-02 12:44:16,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:16,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-12-02 12:44:16,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-02 12:44:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-02 12:44:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2309, Unknown=1, NotChecked=96, Total=2550 [2018-12-02 12:44:16,199 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 51 states. [2018-12-02 12:44:20,154 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-12-02 12:44:21,101 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 12:44:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:22,741 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-12-02 12:44:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 12:44:22,742 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 80 [2018-12-02 12:44:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:22,742 INFO L225 Difference]: With dead ends: 138 [2018-12-02 12:44:22,742 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 12:44:22,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=402, Invalid=5003, Unknown=1, NotChecked=144, Total=5550 [2018-12-02 12:44:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 12:44:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-12-02 12:44:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 12:44:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-12-02 12:44:22,745 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 80 [2018-12-02 12:44:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:22,745 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-12-02 12:44:22,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-02 12:44:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-12-02 12:44:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:44:22,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:22,746 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 12:44:22,746 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:22,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319985, now seen corresponding path program 1 times [2018-12-02 12:44:22,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:44:23,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:23,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:23,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:23,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:23,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:23,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:44:23,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 12:44:23,685 INFO L478 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 11 treesize of output 8 [2018-12-02 12:44:23,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:44:23,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 12:44:23,721 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 12:44:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-02 12:44:23,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,730 INFO L267 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. [2018-12-02 12:44:23,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 12:44:23,804 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 12:44:23,806 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 12:44:23,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,814 INFO L267 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. [2018-12-02 12:44:23,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 12:44:23,853 INFO L478 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 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-02 12:44:23,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:23,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-12-02 12:44:23,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:23,864 INFO L267 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. [2018-12-02 12:44:23,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 12:44:24,547 WARN L854 $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 [2018-12-02 12:44:24,554 INFO L478 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-02 12:44:24,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:24,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:24,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:24,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-02 12:44:24,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,573 INFO L267 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. [2018-12-02 12:44:24,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-12-02 12:44:24,784 INFO L478 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 0 case distinctions, treesize of input 128 treesize of output 120 [2018-12-02 12:44:24,792 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 61 [2018-12-02 12:44:24,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:44:24,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:44:24,828 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2018-12-02 12:44:24,829 INFO L478 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 32 treesize of output 1 [2018-12-02 12:44:24,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,842 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-12-02 12:44:24,843 INFO L478 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 32 treesize of output 1 [2018-12-02 12:44:24,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:24,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:44:24,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:108 [2018-12-02 12:44:25,212 INFO L478 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 44 treesize of output 34 [2018-12-02 12:44:25,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:25,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-12-02 12:44:25,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:25,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:25,225 INFO L478 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 28 treesize of output 22 [2018-12-02 12:44:25,227 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-02 12:44:25,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:25,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:25,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:25,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:13 [2018-12-02 12:44:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-12-02 12:44:25,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:25,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-12-02 12:44:25,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-02 12:44:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-02 12:44:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3255, Unknown=2, NotChecked=114, Total=3540 [2018-12-02 12:44:25,355 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 60 states. [2018-12-02 12:44:37,114 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-12-02 12:44:41,861 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-02 12:44:44,347 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-02 12:44:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:48,416 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-02 12:44:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 12:44:48,417 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 80 [2018-12-02 12:44:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:48,417 INFO L225 Difference]: With dead ends: 137 [2018-12-02 12:44:48,417 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 12:44:48,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=505, Invalid=6977, Unknown=4, NotChecked=170, Total=7656 [2018-12-02 12:44:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 12:44:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-12-02 12:44:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 12:44:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-12-02 12:44:48,421 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 80 [2018-12-02 12:44:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:48,421 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-12-02 12:44:48,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-02 12:44:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-12-02 12:44:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 12:44:48,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:48,422 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:44:48,422 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:48,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1703840404, now seen corresponding path program 2 times [2018-12-02 12:44:48,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 12:44:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:48,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:48,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:44:48,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:44:48,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:44:48,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 12:44:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:48,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 12:44:48,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:44:48,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:44:48,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:44:48,564 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 7 states. [2018-12-02 12:44:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:48,608 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-02 12:44:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:44:48,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-02 12:44:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:48,609 INFO L225 Difference]: With dead ends: 109 [2018-12-02 12:44:48,609 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 12:44:48,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:44:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 12:44:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-02 12:44:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 12:44:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-02 12:44:48,612 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 83 [2018-12-02 12:44:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:48,613 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-02 12:44:48,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:44:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-02 12:44:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 12:44:48,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:48,613 INFO L402 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] [2018-12-02 12:44:48,614 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:48,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash -136290336, now seen corresponding path program 1 times [2018-12-02 12:44:48,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:48,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:44:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 12:44:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:48,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:48,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:48,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 12:44:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 12:44:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-02 12:44:48,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:44:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:44:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:44:48,737 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 9 states. [2018-12-02 12:44:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:48,804 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-02 12:44:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:44:48,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-12-02 12:44:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:48,805 INFO L225 Difference]: With dead ends: 115 [2018-12-02 12:44:48,805 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 12:44:48,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:44:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 12:44:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-02 12:44:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 12:44:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-12-02 12:44:48,808 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 88 [2018-12-02 12:44:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:48,809 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-12-02 12:44:48,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:44:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-12-02 12:44:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:44:48,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:48,809 INFO L402 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] [2018-12-02 12:44:48,810 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 674914628, now seen corresponding path program 1 times [2018-12-02 12:44:48,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 12:44:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:44:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:44:48,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:44:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:44:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:44:48,914 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 12 states. [2018-12-02 12:44:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:49,130 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-02 12:44:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:44:49,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-02 12:44:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:49,131 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:44:49,131 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:44:49,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:44:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:44:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 12:44:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 12:44:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-02 12:44:49,133 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 91 [2018-12-02 12:44:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:49,133 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-02 12:44:49,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:44:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-02 12:44:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:44:49,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:49,134 INFO L402 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] [2018-12-02 12:44:49,134 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:49,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1668542446, now seen corresponding path program 1 times [2018-12-02 12:44:49,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 12:44:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:44:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:44:49,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:44:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:44:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:44:49,198 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-02 12:44:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:49,299 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-02 12:44:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:44:49,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 12:44:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:49,300 INFO L225 Difference]: With dead ends: 109 [2018-12-02 12:44:49,300 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:44:49,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:44:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:44:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 12:44:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 12:44:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-12-02 12:44:49,302 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 94 [2018-12-02 12:44:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:49,303 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-12-02 12:44:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:44:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-12-02 12:44:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:44:49,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:49,303 INFO L402 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] [2018-12-02 12:44:49,304 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:49,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868767, now seen corresponding path program 1 times [2018-12-02 12:44:49,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 12:44:49,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:49,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:49,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:49,436 INFO L478 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 13 [2018-12-02 12:44:49,437 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 12:44:49,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:49,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:49,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:49,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 12:44:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 12:44:49,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:49,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-02 12:44:49,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:44:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:44:49,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:44:49,465 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 11 states. [2018-12-02 12:44:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:44:49,642 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-02 12:44:49,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 12:44:49,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-02 12:44:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:44:49,642 INFO L225 Difference]: With dead ends: 119 [2018-12-02 12:44:49,642 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 12:44:49,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-02 12:44:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 12:44:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2018-12-02 12:44:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 12:44:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-02 12:44:49,644 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-12-02 12:44:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:44:49,645 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-02 12:44:49,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:44:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-02 12:44:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:44:49,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:44:49,645 INFO L402 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] [2018-12-02 12:44:49,645 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:44:49,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:44:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868768, now seen corresponding path program 1 times [2018-12-02 12:44:49,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:44:49,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:44:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:44:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:44:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:44:50,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:44:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:44:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:44:50,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:44:50,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:44:50,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-02 12:44:50,517 INFO L478 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 11 treesize of output 8 [2018-12-02 12:44:50,518 INFO L478 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 8 treesize of output 7 [2018-12-02 12:44:50,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,527 INFO L478 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 11 treesize of output 8 [2018-12-02 12:44:50,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:44:50,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-02 12:44:50,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-02 12:44:50,575 INFO L478 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 12 treesize of output 11 [2018-12-02 12:44:50,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,589 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 12:44:50,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:44:50,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 12:44:50,681 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 60 [2018-12-02 12:44:50,683 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-02 12:44:50,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,703 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 58 [2018-12-02 12:44:50,706 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-12-02 12:44:50,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-12-02 12:44:50,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,773 INFO L478 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 70 treesize of output 69 [2018-12-02 12:44:50,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 84 [2018-12-02 12:44:50,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,801 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-12-02 12:44:50,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:50,804 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 12:44:50,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:50,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:96 [2018-12-02 12:44:51,822 WARN L854 $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 [2018-12-02 12:44:51,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,831 INFO L478 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 95 treesize of output 98 [2018-12-02 12:44:51,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,849 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 121 [2018-12-02 12:44:51,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:44:51,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:51,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,891 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-12-02 12:44:51,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:51,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-12-02 12:44:51,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:51,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:51,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:51,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:82 [2018-12-02 12:44:52,571 WARN L854 $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 [2018-12-02 12:44:52,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:52,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:44:52,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 107 treesize of output 84 [2018-12-02 12:44:52,589 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 74 [2018-12-02 12:44:52,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 12:44:52,664 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-12-02 12:44:52,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:52,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 70 [2018-12-02 12:44:52,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 12:44:52,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 62 [2018-12-02 12:44:52,691 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 12:44:52,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2018-12-02 12:44:52,703 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 12:44:52,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 12:44:52,859 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-02 12:44:52,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2018-12-02 12:44:52,871 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,886 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,890 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-02 12:44:52,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2018-12-02 12:44:52,902 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,917 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,921 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-02 12:44:52,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2018-12-02 12:44:52,933 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,948 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,952 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-12-02 12:44:52,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2018-12-02 12:44:52,965 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-02 12:44:52,981 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 12:44:53,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 13 xjuncts. [2018-12-02 12:44:53,073 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:117, output treesize:343 [2018-12-02 12:44:54,246 INFO L478 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 52 treesize of output 48 [2018-12-02 12:44:54,248 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 12:44:54,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,278 INFO L478 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 44 treesize of output 40 [2018-12-02 12:44:54,279 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 12:44:54,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,306 INFO L478 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 33 treesize of output 25 [2018-12-02 12:44:54,307 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-12-02 12:44:54,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,310 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:44:54,322 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:152, output treesize:11 [2018-12-02 12:44:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-12-02 12:44:54,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:44:54,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 65 [2018-12-02 12:44:54,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-02 12:44:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-02 12:44:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3830, Unknown=2, NotChecked=250, Total=4290 [2018-12-02 12:44:54,464 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 66 states. [2018-12-02 12:44:57,863 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2018-12-02 12:45:00,166 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-12-02 12:45:00,654 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-02 12:45:01,149 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-02 12:45:01,762 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-02 12:45:01,982 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-02 12:45:02,184 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-02 12:45:02,689 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-12-02 12:45:03,034 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-02 12:45:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:03,189 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-02 12:45:03,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 12:45:03,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-12-02 12:45:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:03,190 INFO L225 Difference]: With dead ends: 119 [2018-12-02 12:45:03,190 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 12:45:03,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=567, Invalid=7810, Unknown=3, NotChecked=362, Total=8742 [2018-12-02 12:45:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 12:45:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-12-02 12:45:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 12:45:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-12-02 12:45:03,193 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 94 [2018-12-02 12:45:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:03,193 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-12-02 12:45:03,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-02 12:45:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-12-02 12:45:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:45:03,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:03,193 INFO L402 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] [2018-12-02 12:45:03,193 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:45:03,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2024056639, now seen corresponding path program 1 times [2018-12-02 12:45:03,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:45:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:45:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 12:45:03,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:03,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:03,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:03,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:03,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:03,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:45:03,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 12:45:03,802 INFO L478 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 11 treesize of output 8 [2018-12-02 12:45:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:45:03,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 12:45:03,835 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 12:45:03,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-02 12:45:03,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,843 INFO L267 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. [2018-12-02 12:45:03,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-02 12:45:03,900 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 12:45:03,901 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 12:45:03,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,910 INFO L267 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. [2018-12-02 12:45:03,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-12-02 12:45:03,939 INFO L478 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 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-02 12:45:03,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:03,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-12-02 12:45:03,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:03,949 INFO L267 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. [2018-12-02 12:45:03,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-02 12:45:04,526 WARN L854 $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 [2018-12-02 12:45:04,532 INFO L478 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 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 12:45:04,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:04,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:04,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-02 12:45:04,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:04,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:04,548 INFO L267 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. [2018-12-02 12:45:04,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-12-02 12:45:05,293 WARN L854 $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 [2018-12-02 12:45:05,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:05,298 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:45:05,303 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-12-02 12:45:05,310 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2018-12-02 12:45:05,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:45:05,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:45:05,330 INFO L267 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. [2018-12-02 12:45:05,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-12-02 12:45:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2018-12-02 12:45:17,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:45:17,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2018-12-02 12:45:17,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-02 12:45:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-02 12:45:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2488, Unknown=2, NotChecked=202, Total=2862 [2018-12-02 12:45:17,760 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 54 states. [2018-12-02 12:45:39,539 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-12-02 12:45:47,800 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-12-02 12:45:50,402 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-02 12:45:50,557 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-02 12:45:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:50,730 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-02 12:45:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 12:45:50,731 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2018-12-02 12:45:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:50,731 INFO L225 Difference]: With dead ends: 112 [2018-12-02 12:45:50,731 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 12:45:50,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=437, Invalid=5116, Unknown=5, NotChecked=294, Total=5852 [2018-12-02 12:45:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 12:45:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-02 12:45:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 12:45:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-12-02 12:45:50,734 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2018-12-02 12:45:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:50,734 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-12-02 12:45:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-02 12:45:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-12-02 12:45:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:45:50,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:50,735 INFO L402 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] [2018-12-02 12:45:50,735 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:45:50,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -603173294, now seen corresponding path program 1 times [2018-12-02 12:45:50,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:45:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:45:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:50,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 12:45:51,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:51,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:51,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:51,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:51,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:45:51,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-12-02 12:45:51,946 INFO L478 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 11 treesize of output 8 [2018-12-02 12:45:51,947 INFO L478 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 8 treesize of output 7 [2018-12-02 12:45:51,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,961 INFO L478 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 11 treesize of output 8 [2018-12-02 12:45:51,962 INFO L478 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 8 treesize of output 7 [2018-12-02 12:45:51,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-02 12:45:52,020 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-02 12:45:52,022 INFO L478 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 12 treesize of output 11 [2018-12-02 12:45:52,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,040 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 12:45:52,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:45:52,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 12:45:52,174 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 60 [2018-12-02 12:45:52,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,177 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-12-02 12:45:52,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,200 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-12-02 12:45:52,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-02 12:45:52,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:81 [2018-12-02 12:45:52,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,288 INFO L478 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 106 treesize of output 105 [2018-12-02 12:45:52,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,301 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 114 treesize of output 153 [2018-12-02 12:45:52,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:45:52,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,362 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 85 [2018-12-02 12:45:52,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,365 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-12-02 12:45:52,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:125 [2018-12-02 12:45:52,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 119 treesize of output 86 [2018-12-02 12:45:52,732 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 44 [2018-12-02 12:45:52,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:45:52,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 28 [2018-12-02 12:45:52,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:52,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:52,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-02 12:45:52,796 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:52,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,805 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:52,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,818 INFO L267 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. [2018-12-02 12:45:52,818 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-12-02 12:45:53,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,008 INFO L478 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 138 treesize of output 131 [2018-12-02 12:45:53,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,027 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 186 [2018-12-02 12:45:53,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:45:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,084 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-12-02 12:45:53,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-12-02 12:45:53,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:53,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:168, output treesize:138 [2018-12-02 12:45:53,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 119 treesize of output 86 [2018-12-02 12:45:53,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,193 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 52 [2018-12-02 12:45:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 12:45:53,227 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-12-02 12:45:53,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 62 [2018-12-02 12:45:53,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 12:45:53,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 60 [2018-12-02 12:45:53,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 12:45:53,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 12:45:53,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 12:45:53,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 12:45:53,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-02 12:45:53,344 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:53,344 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,351 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:53,351 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-02 12:45:53,358 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:53,358 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,364 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:53,364 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,367 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-02 12:45:53,370 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:53,370 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,378 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:53,378 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,381 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-02 12:45:53,384 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:53,385 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,391 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:53,391 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,394 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,410 INFO L267 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. [2018-12-02 12:45:53,410 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-12-02 12:45:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,643 INFO L478 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 158 treesize of output 157 [2018-12-02 12:45:53,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,665 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 176 [2018-12-02 12:45:53,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:45:53,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,720 INFO L478 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 63 treesize of output 43 [2018-12-02 12:45:53,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:53,722 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-02 12:45:53,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,727 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 12:45:53,727 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:53,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:53,744 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:169, output treesize:80 [2018-12-02 12:45:54,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:54,674 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 52 [2018-12-02 12:45:54,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:54,685 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2018-12-02 12:45:54,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:45:54,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 22 [2018-12-02 12:45:54,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 12:45:54,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:45:54,716 INFO L267 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. [2018-12-02 12:45:54,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:35 [2018-12-02 12:45:54,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:54,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 12:45:54,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:54,902 INFO L267 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. [2018-12-02 12:45:54,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 12:45:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 12:45:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:45:55,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 70 [2018-12-02 12:45:55,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-02 12:45:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-02 12:45:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4608, Unknown=0, NotChecked=0, Total=4830 [2018-12-02 12:45:55,002 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 70 states. [2018-12-02 12:45:56,790 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2018-12-02 12:45:57,178 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-12-02 12:45:59,637 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-12-02 12:45:59,840 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-12-02 12:46:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:46:00,399 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-02 12:46:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 12:46:00,400 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 99 [2018-12-02 12:46:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:46:00,401 INFO L225 Difference]: With dead ends: 101 [2018-12-02 12:46:00,401 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 12:46:00,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=608, Invalid=8512, Unknown=0, NotChecked=0, Total=9120 [2018-12-02 12:46:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 12:46:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 12:46:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 12:46:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-02 12:46:00,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 99 [2018-12-02 12:46:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:46:00,405 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-02 12:46:00,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-02 12:46:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-02 12:46:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 12:46:00,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:46:00,406 INFO L402 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] [2018-12-02 12:46:00,407 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-02 12:46:00,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:46:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash 616928174, now seen corresponding path program 1 times [2018-12-02 12:46:00,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:46:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:46:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:00,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:46:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:46:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 12:46:01,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:46:01,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:46:01,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:46:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:46:01,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:46:01,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:01,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:01,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 12:46:01,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:01,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:01,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-12-02 12:46:01,998 INFO L478 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 11 treesize of output 8 [2018-12-02 12:46:01,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-02 12:46:01,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-02 12:46:02,058 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 12:46:02,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-02 12:46:02,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,074 INFO L267 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. [2018-12-02 12:46:02,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-12-02 12:46:02,188 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 12:46:02,190 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 12:46:02,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,204 INFO L267 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. [2018-12-02 12:46:02,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-02 12:46:02,260 INFO L478 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 0 case distinctions, treesize of input 57 treesize of output 47 [2018-12-02 12:46:02,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:02,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 59 [2018-12-02 12:46:02,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,278 INFO L267 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. [2018-12-02 12:46:02,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-12-02 12:46:02,535 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:02,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,546 INFO L478 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 44 treesize of output 37 [2018-12-02 12:46:02,547 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 12:46:02,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:02,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:02,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 19 [2018-12-02 12:46:02,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:02,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:02,563 INFO L267 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. [2018-12-02 12:46:02,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-02 12:46:07,953 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 12:46:07,961 INFO L478 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 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-02 12:46:07,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:07,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:07,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:07,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-12-02 12:46:07,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:07,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:07,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:07,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:85 [2018-12-02 12:46:08,057 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:08,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:08,067 INFO L478 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 44 treesize of output 37 [2018-12-02 12:46:08,069 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 12:46:08,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:08,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:08,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 19 [2018-12-02 12:46:08,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:08,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:08,082 INFO L267 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. [2018-12-02 12:46:08,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-02 12:46:15,629 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 12:46:15,637 INFO L478 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 0 case distinctions, treesize of input 84 treesize of output 76 [2018-12-02 12:46:15,645 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 12:46:15,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:46:15,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:46:15,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 12:46:15,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-12-02 12:46:15,794 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:15,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:15,800 INFO L267 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. [2018-12-02 12:46:15,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-02 12:46:15,956 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:15,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:15,964 INFO L267 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. [2018-12-02 12:46:15,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-02 12:46:16,260 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:16,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,268 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 12:46:16,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,274 INFO L267 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. [2018-12-02 12:46:16,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-12-02 12:46:19,089 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-02 12:46:33,083 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 12:46:35,089 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_36 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_36))) (let ((.cse0 (select .cse1 main_~s~0.offset))) (and (= .cse0 (select .cse1 (+ main_~s~0.offset 4))) (not (= .cse0 v_main_~s~0.base_BEFORE_CALL_36)) (<= 0 main_~s~0.offset) (<= main_~s~0.offset 0))))) (exists ((dll_circular_destroy_~head.offset Int)) (and (= (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_dll_circular_destroy_#in~head.base|) dll_circular_destroy_~head.offset) 0) |c_dll_circular_destroy_#in~head.base| 0) |c_#valid|) (<= dll_circular_destroy_~head.offset 0) (<= 0 dll_circular_destroy_~head.offset)))) is different from true [2018-12-02 12:46:35,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:35,097 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:35,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:35,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-12-02 12:46:35,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 12:46:35,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:35,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:35,124 INFO L478 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 61 treesize of output 53 [2018-12-02 12:46:35,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:35,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 49 treesize of output 47 [2018-12-02 12:46:35,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:35,141 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:35,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:35,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:35,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-02 12:46:35,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:35,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:35,158 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:35,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-12-02 12:46:35,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:35,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 12:46:35,187 INFO L267 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. [2018-12-02 12:46:35,187 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-12-02 12:46:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:35,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:46:35,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 68 [2018-12-02 12:46:35,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-02 12:46:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-02 12:46:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4302, Unknown=28, NotChecked=132, Total=4692 [2018-12-02 12:46:35,332 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 69 states. [2018-12-02 12:46:39,039 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 62 [2018-12-02 12:46:45,943 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 12:46:54,566 WARN L180 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 12:47:07,987 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-12-02 12:47:13,963 WARN L180 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-02 12:47:19,887 WARN L180 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2018-12-02 12:47:24,467 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-12-02 12:47:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:24,467 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-12-02 12:47:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 12:47:24,467 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 104 [2018-12-02 12:47:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:24,468 INFO L225 Difference]: With dead ends: 99 [2018-12-02 12:47:24,468 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 12:47:24,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=588, Invalid=8882, Unknown=40, NotChecked=192, Total=9702 [2018-12-02 12:47:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 12:47:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 12:47:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 12:47:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 12:47:24,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-12-02 12:47:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:24,469 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:47:24,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-02 12:47:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 12:47:24,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 12:47:24,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:47:24 BoogieIcfgContainer [2018-12-02 12:47:24,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:47:24,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:47:24,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:47:24,472 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:47:24,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:42:49" (3/4) ... [2018-12-02 12:47:24,475 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 12:47:24,479 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-02 12:47:24,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-12-02 12:47:24,483 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-02 12:47:24,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 12:47:24,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 12:47:24,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0280fc27-bc4d-49fc-8d07-685cc62e4708/bin-2019/uautomizer/witness.graphml [2018-12-02 12:47:24,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:47:24,519 INFO L168 Benchmark]: Toolchain (without parser) took 275911.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.6 MB in the beginning and 919.7 MB in the end (delta: 30.9 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:24,519 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:24,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:24,520 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:24,520 INFO L168 Benchmark]: RCFGBuilder took 320.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:24,520 INFO L168 Benchmark]: TraceAbstraction took 275213.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.0 GB in the beginning and 919.7 MB in the end (delta: 113.3 MB). Peak memory consumption was 149.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:24,520 INFO L168 Benchmark]: Witness Printer took 46.17 ms. Allocated memory is still 1.2 GB. Free memory was 919.7 MB in the beginning and 919.7 MB in the end (delta: 2.3 kB). Peak memory consumption was 2.3 kB. Max. memory is 11.5 GB. [2018-12-02 12:47:24,522 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 320.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275213.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.0 GB in the beginning and 919.7 MB in the end (delta: 113.3 MB). Peak memory consumption was 149.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.17 ms. Allocated memory is still 1.2 GB. Free memory was 919.7 MB in the beginning and 919.7 MB in the end (delta: 2.3 kB). Peak memory consumption was 2.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 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: 586]: 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: 587]: 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: 610]: 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: 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: 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: 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: 603]: 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 - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 117 locations, 31 error locations. SAFE Result, 275.1s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 175.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2923 SDtfs, 3134 SDslu, 16561 SDs, 0 SdLazy, 28588 SolverSat, 855 SolverUnsat, 96 SolverUnknown, 0 SolverNotchecked, 105.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2169 GetRequests, 1126 SyntacticMatches, 100 SemanticMatches, 943 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 12425 ImplicationChecksByTransitivity, 159.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 326 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 96.8s InterpolantComputationTime, 3528 NumberOfCodeBlocks, 3501 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3470 ConstructedInterpolants, 280 QuantifiedInterpolants, 3258646 SizeOfPredicates, 255 NumberOfNonLiveVariables, 6559 ConjunctsInSsa, 980 ConjunctsInUnsatCore, 58 InterpolantComputations, 20 PerfectInterpolantSequences, 842/1172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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...