./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_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:05,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:24:05,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:24:05,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:24:05,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:24:05,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:24:05,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:24:05,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:24:05,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:24:05,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:24:05,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:24:05,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:24:05,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:24:05,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:24:05,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:24:05,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:24:05,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:24:05,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:24:05,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:24:05,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:24:05,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:24:05,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:24:05,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:24:05,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:24:05,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:24:05,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:24:05,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:24:05,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:24:05,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:24:05,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:24:05,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:24:05,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:24:05,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:24:05,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:24:05,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:24:05,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:24:05,990 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 04:24:05,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:24:05,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:24:05,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:24:05,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:24:05,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:24:05,998 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:24:05,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:24:05,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:24:06,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:24:06,000 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:24:06,000 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:24:06,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:24:06,000 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_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:06,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:24:06,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:24:06,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:24:06,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:24:06,030 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:24:06,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:24:06,069 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/data/03821eb16/9c0e611629074056ab94cf2a5fd7aa12/FLAG4c9b774f1 [2018-12-09 04:24:06,481 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:24:06,481 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:24:06,487 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/data/03821eb16/9c0e611629074056ab94cf2a5fd7aa12/FLAG4c9b774f1 [2018-12-09 04:24:06,495 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/data/03821eb16/9c0e611629074056ab94cf2a5fd7aa12 [2018-12-09 04:24:06,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:24:06,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 04:24:06,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:24:06,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:24:06,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:24:06,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5e1b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06, skipping insertion in model container [2018-12-09 04:24:06,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:24:06,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:24:06,682 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:24:06,721 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:24:06,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:24:06,785 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:24:06,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06 WrapperNode [2018-12-09 04:24:06,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:24:06,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:24:06,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:24:06,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:24:06,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... [2018-12-09 04:24:06,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:24:06,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:24:06,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:24:06,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:24:06,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-09 04:24:06,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:24:06,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 04:24:06,852 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 04:24:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 04:24:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 04:24:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 04:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 04:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 04:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 04:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:24:07,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:24:07,159 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 04:24:07,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:07 BoogieIcfgContainer [2018-12-09 04:24:07,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:24:07,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:24:07,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:24:07,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:24:07,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:24:06" (1/3) ... [2018-12-09 04:24:07,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cbf472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:24:07, skipping insertion in model container [2018-12-09 04:24:07,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:06" (2/3) ... [2018-12-09 04:24:07,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cbf472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:24:07, skipping insertion in model container [2018-12-09 04:24:07,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:07" (3/3) ... [2018-12-09 04:24:07,164 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:24:07,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:24:07,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-09 04:24:07,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-09 04:24:07,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:24:07,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:24:07,200 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 04:24:07,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:24:07,200 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:24:07,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:24:07,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:24:07,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:24:07,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:24:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-12-09 04:24:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:24:07,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:24:07,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-12-09 04:24:07,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:07,317 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-09 04:24:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:24:07,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:24:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:24:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:24:07,329 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-12-09 04:24:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:07,402 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-12-09 04:24:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:24:07,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 04:24:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:07,409 INFO L225 Difference]: With dead ends: 106 [2018-12-09 04:24:07,409 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 04:24:07,410 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-09 04:24:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 04:24:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-09 04:24:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 04:24:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-09 04:24:07,436 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-12-09 04:24:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:07,436 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-09 04:24:07,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:24:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-09 04:24:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:24:07,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:24:07,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-12-09 04:24:07,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:07,473 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-09 04:24:07,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:07,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:24:07,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:24:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:24:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:24:07,475 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-12-09 04:24:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:07,515 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-09 04:24:07,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:24:07,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 04:24:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:07,516 INFO L225 Difference]: With dead ends: 96 [2018-12-09 04:24:07,516 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 04:24:07,517 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-09 04:24:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 04:24:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-09 04:24:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 04:24:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-09 04:24:07,522 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-12-09 04:24:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:07,522 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 04:24:07,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:24:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-09 04:24:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:24:07,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,522 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-09 04:24:07,523 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-12-09 04:24:07,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:07,554 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-09 04:24:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:24:07,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:24:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:24:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:24:07,555 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-09 04:24:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:07,584 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-09 04:24:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:24:07,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 04:24:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:07,585 INFO L225 Difference]: With dead ends: 97 [2018-12-09 04:24:07,585 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 04:24:07,586 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-09 04:24:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 04:24:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 04:24:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 04:24:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-12-09 04:24:07,590 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-12-09 04:24:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:07,591 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-12-09 04:24:07,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:24:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-12-09 04:24:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:24:07,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,592 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-09 04:24:07,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-12-09 04:24:07,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:07,672 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-09 04:24:07,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:07,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:24:07,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:24:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:24:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:24:07,673 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-12-09 04:24:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:07,786 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-12-09 04:24:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:07,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 04:24:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:07,788 INFO L225 Difference]: With dead ends: 97 [2018-12-09 04:24:07,788 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 04:24:07,788 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-09 04:24:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 04:24:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-09 04:24:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 04:24:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-09 04:24:07,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-12-09 04:24:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:07,792 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 04:24:07,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:24:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-09 04:24:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:24:07,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,793 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-09 04:24:07,793 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-12-09 04:24:07,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:07,828 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-09 04:24:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:24:07,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:24:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:24:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:24:07,829 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-12-09 04:24:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:07,909 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-09 04:24:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:07,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 04:24:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:07,910 INFO L225 Difference]: With dead ends: 96 [2018-12-09 04:24:07,910 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 04:24:07,910 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-09 04:24:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 04:24:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-12-09 04:24:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 04:24:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-12-09 04:24:07,916 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-12-09 04:24:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:07,916 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-12-09 04:24:07,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:24:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-12-09 04:24:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 04:24:07,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:07,917 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-09 04:24:07,917 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:07,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-12-09 04:24:07,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:07,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:08,052 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-09 04:24:08,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:08,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:08,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:09,415 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-09 04:24:09,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:09,419 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-09 04:24:09,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 04:24:09,427 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-09 04:24:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:09,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-09 04:24:09,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:24:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:24:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-09 04:24:09,443 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-12-09 04:24:09,764 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 04:24:10,099 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 04:24:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:10,323 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-09 04:24:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:24:10,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-09 04:24:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:10,324 INFO L225 Difference]: With dead ends: 132 [2018-12-09 04:24:10,325 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 04:24:10,325 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-09 04:24:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 04:24:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-09 04:24:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 04:24:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-12-09 04:24:10,329 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-12-09 04:24:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:10,329 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-12-09 04:24:10,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:24:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-12-09 04:24:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 04:24:10,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:10,330 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-09 04:24:10,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:10,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-12-09 04:24:10,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:10,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:10,417 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-09 04:24:10,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:10,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:10,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:10,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:10,448 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-09 04:24:10,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:10,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:10,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 04:24:10,709 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-09 04:24:10,716 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-09 04:24:10,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:10,720 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-09 04:24:10,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-09 04:24:10,726 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-09 04:24:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-09 04:24:10,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:24:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:24:10,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-12-09 04:24:10,751 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-12-09 04:24:11,279 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-09 04:24:11,798 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-09 04:24:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:11,991 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 04:24:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:24:11,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-09 04:24:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:11,992 INFO L225 Difference]: With dead ends: 101 [2018-12-09 04:24:11,992 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 04:24:11,992 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-09 04:24:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 04:24:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 04:24:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 04:24:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-09 04:24:11,995 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-12-09 04:24:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:11,995 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-09 04:24:11,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:24:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-09 04:24:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 04:24:11,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:11,996 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-09 04:24:11,996 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:11,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-12-09 04:24:11,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:11,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:11,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,021 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-09 04:24:12,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:12,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:12,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:12,075 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-09 04:24:12,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:12,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-12-09 04:24:12,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:24:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:24:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:24:12,090 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-12-09 04:24:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:12,138 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-12-09 04:24:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:12,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-09 04:24:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:12,139 INFO L225 Difference]: With dead ends: 101 [2018-12-09 04:24:12,139 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 04:24:12,139 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-09 04:24:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 04:24:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 04:24:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 04:24:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-12-09 04:24:12,143 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-12-09 04:24:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:12,143 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-12-09 04:24:12,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:24:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-12-09 04:24:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 04:24:12,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:12,144 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-09 04:24:12,144 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:12,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-12-09 04:24:12,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:12,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,218 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-09 04:24:12,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:12,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:12,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:12,272 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-09 04:24:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 04:24:12,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:24:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:24:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:24:12,298 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-12-09 04:24:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:12,393 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-09 04:24:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:24:12,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-09 04:24:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:12,394 INFO L225 Difference]: With dead ends: 111 [2018-12-09 04:24:12,394 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 04:24:12,394 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-09 04:24:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 04:24:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-09 04:24:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 04:24:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-09 04:24:12,403 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-12-09 04:24:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:12,403 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-09 04:24:12,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:24:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-09 04:24:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 04:24:12,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:12,404 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-09 04:24:12,404 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:12,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-12-09 04:24:12,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,444 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-09 04:24:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:12,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:12,478 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-09 04:24:12,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:12,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-09 04:24:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:24:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:24:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:24:12,503 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-12-09 04:24:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:12,566 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-09 04:24:12,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:12,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 04:24:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:12,567 INFO L225 Difference]: With dead ends: 104 [2018-12-09 04:24:12,567 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 04:24:12,567 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-09 04:24:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 04:24:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-09 04:24:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 04:24:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-09 04:24:12,569 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-12-09 04:24:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:12,569 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-09 04:24:12,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:24:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-09 04:24:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 04:24:12,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:12,570 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-09 04:24:12,570 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:12,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-12-09 04:24:12,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,598 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-09 04:24:12,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:12,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:24:12,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:24:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:24:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:24:12,599 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-12-09 04:24:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:12,689 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-09 04:24:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:24:12,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 04:24:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:12,690 INFO L225 Difference]: With dead ends: 103 [2018-12-09 04:24:12,690 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 04:24:12,690 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-09 04:24:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 04:24:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-09 04:24:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 04:24:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-09 04:24:12,693 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-12-09 04:24:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:12,693 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-09 04:24:12,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:24:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-09 04:24:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 04:24:12,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:12,694 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-09 04:24:12,694 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-12-09 04:24:12,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:12,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,741 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-09 04:24:12,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:12,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:24:12,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:24:12,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:24:12,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:24:12,742 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-09 04:24:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:12,846 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 04:24:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:24:12,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 04:24:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:12,847 INFO L225 Difference]: With dead ends: 101 [2018-12-09 04:24:12,847 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 04:24:12,847 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-09 04:24:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 04:24:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-09 04:24:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 04:24:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-12-09 04:24:12,850 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-12-09 04:24:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:12,850 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-12-09 04:24:12,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:24:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-12-09 04:24:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:24:12,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:12,851 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-09 04:24:12,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:12,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-12-09 04:24:12,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:12,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:12,937 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-09 04:24:12,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:12,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:24:12,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:24:12,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:24:12,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:24:12,938 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-12-09 04:24:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:13,200 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-09 04:24:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:24:13,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-09 04:24:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:13,201 INFO L225 Difference]: With dead ends: 107 [2018-12-09 04:24:13,201 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:24:13,201 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-09 04:24:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:24:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-09 04:24:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 04:24:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-12-09 04:24:13,204 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-12-09 04:24:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:13,205 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-12-09 04:24:13,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:24:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-12-09 04:24:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:24:13,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:13,206 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-09 04:24:13,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:13,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-12-09 04:24:13,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:13,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:13,323 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-09 04:24:13,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:13,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:24:13,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:24:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:24:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:24:13,324 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 12 states. [2018-12-09 04:24:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:13,562 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-09 04:24:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:24:13,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-09 04:24:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:13,563 INFO L225 Difference]: With dead ends: 107 [2018-12-09 04:24:13,563 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:24:13,563 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-09 04:24:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:24:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-09 04:24:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 04:24:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-12-09 04:24:13,565 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2018-12-09 04:24:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:13,565 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-12-09 04:24:13,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:24:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-12-09 04:24:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 04:24:13,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:13,566 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-09 04:24:13,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:13,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686117, now seen corresponding path program 1 times [2018-12-09 04:24:13,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:13,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:13,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:13,645 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-09 04:24:13,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:13,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:24:13,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:24:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:24:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:24:13,646 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 12 states. [2018-12-09 04:24:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:13,860 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-12-09 04:24:13,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:24:13,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-12-09 04:24:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:13,861 INFO L225 Difference]: With dead ends: 121 [2018-12-09 04:24:13,861 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 04:24:13,861 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-09 04:24:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 04:24:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-12-09 04:24:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 04:24:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-12-09 04:24:13,863 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 47 [2018-12-09 04:24:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:13,864 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-12-09 04:24:13,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:24:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-12-09 04:24:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 04:24:13,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:13,864 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-09 04:24:13,864 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:13,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686116, now seen corresponding path program 1 times [2018-12-09 04:24:13,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:13,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:13,884 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-09 04:24:13,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:13,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:24:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:24:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:24:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:24:13,885 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 4 states. [2018-12-09 04:24:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:13,903 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-12-09 04:24:13,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:24:13,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 04:24:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:13,904 INFO L225 Difference]: With dead ends: 114 [2018-12-09 04:24:13,904 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 04:24:13,904 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-09 04:24:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 04:24:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2018-12-09 04:24:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 04:24:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-12-09 04:24:13,906 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 47 [2018-12-09 04:24:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-12-09 04:24:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:24:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-12-09 04:24:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 04:24:13,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:13,907 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-09 04:24:13,907 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:13,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:13,907 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-12-09 04:24:13,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:13,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:13,946 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-09 04:24:13,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:13,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:24:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:24:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:24:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:24:13,947 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2018-12-09 04:24:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:13,970 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-09 04:24:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:13,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 04:24:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:13,971 INFO L225 Difference]: With dead ends: 96 [2018-12-09 04:24:13,971 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 04:24:13,971 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-09 04:24:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 04:24:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-09 04:24:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 04:24:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-12-09 04:24:13,973 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2018-12-09 04:24:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:13,974 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-12-09 04:24:13,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:24:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-12-09 04:24:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 04:24:13,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:13,974 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-09 04:24:13,975 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:13,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-12-09 04:24:13,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,000 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-09 04:24:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:24:14,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:24:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:24:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:24:14,001 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 5 states. [2018-12-09 04:24:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:14,025 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-12-09 04:24:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:24:14,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 04:24:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:14,026 INFO L225 Difference]: With dead ends: 107 [2018-12-09 04:24:14,026 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:24:14,026 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-09 04:24:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:24:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-12-09 04:24:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 04:24:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-12-09 04:24:14,029 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2018-12-09 04:24:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:14,029 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-12-09 04:24:14,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:24:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-12-09 04:24:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 04:24:14,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:14,030 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-09 04:24:14,030 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:14,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081466, now seen corresponding path program 1 times [2018-12-09 04:24:14,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,101 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-09 04:24:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:24:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:24:14,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:24:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:24:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:24:14,102 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-12-09 04:24:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:14,270 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-12-09 04:24:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:24:14,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-09 04:24:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:14,271 INFO L225 Difference]: With dead ends: 107 [2018-12-09 04:24:14,271 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:24:14,272 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-09 04:24:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:24:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-09 04:24:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 04:24:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-12-09 04:24:14,274 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2018-12-09 04:24:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:14,275 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-12-09 04:24:14,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:24:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-12-09 04:24:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 04:24:14,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:14,275 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-09 04:24:14,276 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:14,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081465, now seen corresponding path program 1 times [2018-12-09 04:24:14,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,306 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-09 04:24:14,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:14,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:14,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:14,375 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-09 04:24:14,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:14,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-09 04:24:14,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:24:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:24:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:24:14,391 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 7 states. [2018-12-09 04:24:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:14,424 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-12-09 04:24:14,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:24:14,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-09 04:24:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:14,425 INFO L225 Difference]: With dead ends: 118 [2018-12-09 04:24:14,425 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 04:24:14,425 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-09 04:24:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 04:24:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-12-09 04:24:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 04:24:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-09 04:24:14,427 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 55 [2018-12-09 04:24:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:14,427 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-09 04:24:14,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:24:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-09 04:24:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 04:24:14,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:14,428 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-09 04:24:14,428 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:14,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 186975810, now seen corresponding path program 1 times [2018-12-09 04:24:14,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,801 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-09 04:24:14,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:14,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:14,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:14,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:14,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:14,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:14,877 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-09 04:24:14,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 04:24:14,915 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-09 04:24:14,916 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-09 04:24:14,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 04:24:14,945 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-09 04:24:14,946 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-09 04:24:14,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:14,953 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-09 04:24:14,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 04:24:15,010 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-09 04:24:15,013 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-09 04:24:15,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:15,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:15,024 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-09 04:24:15,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-09 04:24:17,061 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-09 04:24:17,067 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-09 04:24:17,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:17,070 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-09 04:24:17,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:17,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:17,083 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-09 04:24:17,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-12-09 04:24:17,233 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-09 04:24:17,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:17,235 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-09 04:24:17,236 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-09 04:24:17,243 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-09 04:24:17,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:17,246 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-09 04:24:17,249 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-09 04:24:17,249 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2018-12-09 04:24:26,345 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 04:24:26,354 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-09 04:24:26,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:26,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:26,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:26,361 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-09 04:24:26,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:26,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:26,374 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-09 04:24:26,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:51 [2018-12-09 04:24:26,499 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-09 04:24:26,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:26,501 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-09 04:24:26,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:26,508 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-09 04:24:26,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:26,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:26,512 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-09 04:24:26,512 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-12-09 04:24:26,531 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-09 04:24:26,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:24:26,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 43 [2018-12-09 04:24:26,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 04:24:26,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 04:24:26,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1765, Unknown=19, NotChecked=0, Total=1892 [2018-12-09 04:24:26,547 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 44 states. [2018-12-09 04:24:37,904 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-09 04:24:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:24:44,847 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-12-09 04:24:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 04:24:44,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 56 [2018-12-09 04:24:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:24:44,849 INFO L225 Difference]: With dead ends: 178 [2018-12-09 04:24:44,849 INFO L226 Difference]: Without dead ends: 178 [2018-12-09 04:24:44,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=338, Invalid=4064, Unknown=20, NotChecked=0, Total=4422 [2018-12-09 04:24:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-09 04:24:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2018-12-09 04:24:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-09 04:24:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2018-12-09 04:24:44,853 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 56 [2018-12-09 04:24:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:24:44,853 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-12-09 04:24:44,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 04:24:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2018-12-09 04:24:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 04:24:44,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:24:44,853 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-09 04:24:44,854 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:24:44,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:24:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 186975811, now seen corresponding path program 1 times [2018-12-09 04:24:44,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:24:44,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:24:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:44,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:24:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:45,390 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-09 04:24:45,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:24:45,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:24:45,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:24:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:24:45,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:24:45,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:45,647 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-09 04:24:45,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:45,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:45,658 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-09 04:24:45,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-09 04:24:45,726 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-09 04:24:45,728 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-09 04:24:45,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,740 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-09 04:24:45,742 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-09 04:24:45,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-12-09 04:24:45,794 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-09 04:24:45,796 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-09 04:24:45,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,814 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-09 04:24:45,816 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-09 04:24:45,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2018-12-09 04:24:45,933 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-09 04:24:45,936 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-09 04:24:45,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,972 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-09 04:24:45,975 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-09 04:24:45,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:45,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:110 [2018-12-09 04:24:46,055 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-09 04:24:46,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:46,058 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-09 04:24:46,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,093 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-09 04:24:46,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:46,096 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-09 04:24:46,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,121 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-09 04:24:46,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:169, output treesize:173 [2018-12-09 04:24:46,396 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-09 04:24:46,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:46,400 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-09 04:24:46,401 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-09 04:24:46,415 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-09 04:24:46,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,423 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-09 04:24:46,436 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-09 04:24:46,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:24:46,439 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-09 04:24:46,440 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-09 04:24:46,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, 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-09 04:24:46,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:24:46,472 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-09 04:24:46,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:179, output treesize:21 [2018-12-09 04:25:03,193 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 04:25:03,204 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-09 04:25:03,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,212 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-09 04:25:03,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,263 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-09 04:25:03,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,270 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-09 04:25:03,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,304 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-09 04:25:03,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:228, output treesize:199 [2018-12-09 04:25:03,539 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-09 04:25:03,542 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-09 04:25:03,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,555 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-09 04:25:03,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,575 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-09 04:25:03,578 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-09 04:25:03,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:03,586 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-09 04:25:03,587 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:03,595 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-09 04:25:03,595 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:187, output treesize:23 [2018-12-09 04:25:03,700 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-09 04:25:03,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:25:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2018-12-09 04:25:03,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 04:25:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 04:25:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2499, Unknown=16, NotChecked=0, Total=2652 [2018-12-09 04:25:03,716 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 52 states. [2018-12-09 04:25:17,798 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-12-09 04:25:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:30,849 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2018-12-09 04:25:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 04:25:30,850 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2018-12-09 04:25:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:30,851 INFO L225 Difference]: With dead ends: 256 [2018-12-09 04:25:30,851 INFO L226 Difference]: Without dead ends: 256 [2018-12-09 04:25:30,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=436, Invalid=6027, Unknown=17, NotChecked=0, Total=6480 [2018-12-09 04:25:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-09 04:25:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 141. [2018-12-09 04:25:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 04:25:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2018-12-09 04:25:30,856 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 56 [2018-12-09 04:25:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:30,856 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2018-12-09 04:25:30,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 04:25:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2018-12-09 04:25:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 04:25:30,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:30,857 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-09 04:25:30,857 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:30,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -374568026, now seen corresponding path program 2 times [2018-12-09 04:25:30,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:30,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:30,886 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-09 04:25:30,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:25:30,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:25:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:25:30,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:25:30,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:25:30,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:25:30,957 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-09 04:25:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:25:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 04:25:30,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:25:30,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:25:30,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:25:30,974 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 7 states. [2018-12-09 04:25:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:31,015 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-12-09 04:25:31,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:25:31,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-09 04:25:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:31,016 INFO L225 Difference]: With dead ends: 122 [2018-12-09 04:25:31,017 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 04:25:31,017 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-09 04:25:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 04:25:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-09 04:25:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 04:25:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-09 04:25:31,020 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 59 [2018-12-09 04:25:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:31,021 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-09 04:25:31,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:25:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-09 04:25:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 04:25:31,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:31,021 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-09 04:25:31,022 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:31,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1825281605, now seen corresponding path program 2 times [2018-12-09 04:25:31,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:31,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:25:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:31,061 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-09 04:25:31,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:25:31,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:25:31,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:25:31,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 04:25:31,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:25:31,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:25:31,262 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-09 04:25:31,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:25:31,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2018-12-09 04:25:31,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 04:25:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 04:25:31,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:25:31,279 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 18 states. [2018-12-09 04:25:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:31,644 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-12-09 04:25:31,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:25:31,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-12-09 04:25:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:31,645 INFO L225 Difference]: With dead ends: 129 [2018-12-09 04:25:31,645 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 04:25:31,645 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-09 04:25:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 04:25:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-12-09 04:25:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 04:25:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-12-09 04:25:31,647 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 63 [2018-12-09 04:25:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:31,647 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-12-09 04:25:31,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 04:25:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-12-09 04:25:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:25:31,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:31,648 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-09 04:25:31,648 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:31,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash 789761038, now seen corresponding path program 1 times [2018-12-09 04:25:31,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:25:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:31,675 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-09 04:25:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:25:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:25:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:25:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:25:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:25:31,675 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 5 states. [2018-12-09 04:25:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:31,692 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-12-09 04:25:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:25:31,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:25:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:31,693 INFO L225 Difference]: With dead ends: 131 [2018-12-09 04:25:31,693 INFO L226 Difference]: Without dead ends: 131 [2018-12-09 04:25:31,693 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-09 04:25:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-09 04:25:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-09 04:25:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 04:25:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-12-09 04:25:31,695 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 66 [2018-12-09 04:25:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:31,695 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-12-09 04:25:31,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:25:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-12-09 04:25:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:25:31,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:31,695 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-09 04:25:31,696 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:31,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1443647666, now seen corresponding path program 3 times [2018-12-09 04:25:31,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:31,726 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-09 04:25:31,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:25:31,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:25:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:25:32,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 04:25:32,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:25:32,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:25:32,353 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-09 04:25:32,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:25:32,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-12-09 04:25:32,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:25:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:25:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:25:32,370 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 12 states. [2018-12-09 04:25:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:32,432 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-09 04:25:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:25:32,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-09 04:25:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:32,434 INFO L225 Difference]: With dead ends: 115 [2018-12-09 04:25:32,434 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 04:25:32,434 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-09 04:25:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 04:25:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-09 04:25:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 04:25:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-12-09 04:25:32,437 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 67 [2018-12-09 04:25:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:32,437 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-12-09 04:25:32,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:25:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-12-09 04:25:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 04:25:32,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:32,438 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-09 04:25:32,438 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:32,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash -719196084, now seen corresponding path program 1 times [2018-12-09 04:25:32,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:32,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:32,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:25:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:32,550 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-09 04:25:32,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:25:32,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:25:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:25:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:25:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:25:32,551 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 12 states. [2018-12-09 04:25:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:32,733 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-12-09 04:25:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:25:32,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-09 04:25:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:32,734 INFO L225 Difference]: With dead ends: 119 [2018-12-09 04:25:32,734 INFO L226 Difference]: Without dead ends: 119 [2018-12-09 04:25:32,734 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-09 04:25:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-09 04:25:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-12-09 04:25:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 04:25:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-12-09 04:25:32,736 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 77 [2018-12-09 04:25:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:32,736 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-12-09 04:25:32,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:25:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-12-09 04:25:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 04:25:32,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:32,737 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-09 04:25:32,737 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:32,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319984, now seen corresponding path program 1 times [2018-12-09 04:25:32,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:33,228 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-09 04:25:33,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:25:33,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:25:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:33,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:25:33,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:33,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:33,330 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-09 04:25:33,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 04:25:33,370 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-09 04:25:33,371 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-09 04:25:33,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 04:25:33,400 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-09 04:25:33,401 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-09 04:25:33,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,408 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-09 04:25:33,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 04:25:33,464 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-09 04:25:33,467 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-09 04:25:33,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,475 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-09 04:25:33,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 04:25:33,509 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-09 04:25:33,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:33,511 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-09 04:25:33,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:33,519 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-09 04:25:33,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 04:25:34,139 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-09 04:25:34,147 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-09 04:25:34,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:34,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:34,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:34,152 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-09 04:25:34,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:34,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:34,163 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-09 04:25:34,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-12-09 04:25:34,926 WARN L180 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 04:25:34,932 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-09 04:25:34,939 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-09 04:25:34,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:25:34,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:25:34,967 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-09 04:25:34,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-12-09 04:25:35,180 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-09 04:25:35,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:35,182 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-09 04:25:35,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:35,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:35,187 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-09 04:25:35,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-12-09 04:25:35,214 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-09 04:25:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:25:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-12-09 04:25:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-09 04:25:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-09 04:25:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2309, Unknown=1, NotChecked=96, Total=2550 [2018-12-09 04:25:35,230 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 51 states. [2018-12-09 04:25:40,302 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-12-09 04:25:41,222 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 04:25:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:25:42,055 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-12-09 04:25:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 04:25:42,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 80 [2018-12-09 04:25:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:25:42,056 INFO L225 Difference]: With dead ends: 138 [2018-12-09 04:25:42,056 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 04:25:42,057 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-09 04:25:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 04:25:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-12-09 04:25:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 04:25:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-12-09 04:25:42,059 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 80 [2018-12-09 04:25:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:25:42,059 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-12-09 04:25:42,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-09 04:25:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-12-09 04:25:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 04:25:42,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:25:42,060 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-09 04:25:42,060 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:25:42,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:25:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319985, now seen corresponding path program 1 times [2018-12-09 04:25:42,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:25:42,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:25:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:25:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:42,786 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-09 04:25:42,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:25:42,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:25:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:25:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:25:42,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:25:43,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:43,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:43,001 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-09 04:25:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 04:25:43,057 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-09 04:25:43,058 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-09 04:25:43,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 04:25:43,093 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-09 04:25:43,094 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-09 04:25:43,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,101 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-09 04:25:43,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 04:25:43,174 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-09 04:25:43,176 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-09 04:25:43,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,184 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-09 04:25:43,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 04:25:43,229 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-09 04:25:43,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:43,232 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-09 04:25:43,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:43,240 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-09 04:25:43,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 04:25:44,000 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-09 04:25:44,007 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-09 04:25:44,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:44,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:44,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:44,012 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-09 04:25:44,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,023 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-09 04:25:44,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-12-09 04:25:44,234 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-09 04:25:44,241 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-09 04:25:44,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:25:44,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:25:44,278 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-09 04:25:44,280 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-09 04:25:44,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,292 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-09 04:25:44,295 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-09 04:25:44,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,314 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-09 04:25:44,315 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:108 [2018-12-09 04:25:44,634 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-09 04:25:44,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:25:44,636 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-09 04:25:44,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,648 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-09 04:25:44,649 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-09 04:25:44,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:25:44,654 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-09 04:25:44,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:13 [2018-12-09 04:25:44,742 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-09 04:25:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:25:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-12-09 04:25:44,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-09 04:25:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-09 04:25:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3251, Unknown=6, NotChecked=114, Total=3540 [2018-12-09 04:25:44,758 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 60 states. [2018-12-09 04:25:52,860 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 04:25:56,589 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-09 04:25:58,880 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-09 04:26:01,913 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-12-09 04:26:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:05,231 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-09 04:26:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 04:26:05,233 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 80 [2018-12-09 04:26:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:05,235 INFO L225 Difference]: With dead ends: 137 [2018-12-09 04:26:05,236 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 04:26:05,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=505, Invalid=6973, Unknown=8, NotChecked=170, Total=7656 [2018-12-09 04:26:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 04:26:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-12-09 04:26:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 04:26:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-12-09 04:26:05,249 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 80 [2018-12-09 04:26:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:05,249 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-12-09 04:26:05,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-09 04:26:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-12-09 04:26:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 04:26:05,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:05,251 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-09 04:26:05,252 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:05,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1703840404, now seen corresponding path program 2 times [2018-12-09 04:26:05,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:05,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:05,296 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-09 04:26:05,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:26:05,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:26:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:26:05,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:26:05,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:26:05,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:26:05,384 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-09 04:26:05,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:26:05,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 04:26:05,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:26:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:26:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:26:05,410 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 7 states. [2018-12-09 04:26:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:05,451 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-09 04:26:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:26:05,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-09 04:26:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:05,452 INFO L225 Difference]: With dead ends: 109 [2018-12-09 04:26:05,452 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 04:26:05,453 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-09 04:26:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 04:26:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 04:26:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 04:26:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-09 04:26:05,455 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 83 [2018-12-09 04:26:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:05,455 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-09 04:26:05,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:26:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-09 04:26:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 04:26:05,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:05,456 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-09 04:26:05,456 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:05,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash -136290336, now seen corresponding path program 1 times [2018-12-09 04:26:05,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:05,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:26:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:05,503 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-09 04:26:05,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:26:05,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:26:05,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:05,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:26:05,567 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-09 04:26:05,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:26:05,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-09 04:26:05,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:26:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:26:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:26:05,592 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 9 states. [2018-12-09 04:26:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:05,664 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-09 04:26:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:26:05,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-12-09 04:26:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:05,665 INFO L225 Difference]: With dead ends: 115 [2018-12-09 04:26:05,665 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 04:26:05,666 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-09 04:26:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 04:26:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-09 04:26:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 04:26:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-12-09 04:26:05,669 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 88 [2018-12-09 04:26:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:05,669 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-12-09 04:26:05,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:26:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-12-09 04:26:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 04:26:05,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:05,670 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-09 04:26:05,670 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:05,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 674914628, now seen corresponding path program 1 times [2018-12-09 04:26:05,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:05,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:05,780 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-09 04:26:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:26:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:26:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:26:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:26:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:26:05,781 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 12 states. [2018-12-09 04:26:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:05,981 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-09 04:26:05,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:26:05,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-09 04:26:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:05,982 INFO L225 Difference]: With dead ends: 107 [2018-12-09 04:26:05,982 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:26:05,982 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-09 04:26:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:26:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 04:26:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 04:26:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 04:26:05,985 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 91 [2018-12-09 04:26:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:05,985 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 04:26:05,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:26:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 04:26:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 04:26:05,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:05,986 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-09 04:26:05,986 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:05,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1668542446, now seen corresponding path program 1 times [2018-12-09 04:26:05,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:06,055 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-09 04:26:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:26:06,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 04:26:06,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:26:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:26:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:26:06,056 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-09 04:26:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:06,194 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-09 04:26:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:26:06,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-09 04:26:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:06,195 INFO L225 Difference]: With dead ends: 109 [2018-12-09 04:26:06,195 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 04:26:06,195 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-09 04:26:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 04:26:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 04:26:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 04:26:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-12-09 04:26:06,197 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 94 [2018-12-09 04:26:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:06,197 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-12-09 04:26:06,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:26:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-12-09 04:26:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 04:26:06,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:06,198 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-09 04:26:06,198 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:06,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868767, now seen corresponding path program 1 times [2018-12-09 04:26:06,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:06,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:06,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:06,269 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-09 04:26:06,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:26:06,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:26:06,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:06,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:26:06,336 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-09 04:26:06,337 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-09 04:26:06,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:06,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:06,339 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-09 04:26:06,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:26:06,353 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-09 04:26:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:26:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 04:26:06,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 04:26:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 04:26:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:26:06,369 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 11 states. [2018-12-09 04:26:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:06,580 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-09 04:26:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 04:26:06,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-09 04:26:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:06,580 INFO L225 Difference]: With dead ends: 119 [2018-12-09 04:26:06,580 INFO L226 Difference]: Without dead ends: 119 [2018-12-09 04:26:06,581 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-09 04:26:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-09 04:26:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2018-12-09 04:26:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 04:26:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 04:26:06,583 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-12-09 04:26:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:06,583 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 04:26:06,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 04:26:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 04:26:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 04:26:06,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:06,584 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-09 04:26:06,584 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:06,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868768, now seen corresponding path program 1 times [2018-12-09 04:26:06,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:06,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:06,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:06,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:07,314 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-09 04:26:07,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:26:07,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:26:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:07,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:26:07,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,445 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-09 04:26:07,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-09 04:26:07,516 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-09 04:26:07,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-09 04:26:07,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,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-09 04:26:07,528 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-09 04:26:07,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-09 04:26:07,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-09 04:26:07,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-09 04:26:07,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,587 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-09 04:26:07,589 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-09 04:26:07,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 04:26:07,679 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-09 04:26:07,682 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-09 04:26:07,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,700 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-09 04:26:07,702 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-09 04:26:07,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-12-09 04:26:07,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,770 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-09 04:26:07,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,772 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-09 04:26:07,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,796 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-09 04:26:07,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:07,800 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-09 04:26:07,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:07,817 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-09 04:26:07,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:96 [2018-12-09 04:26:08,795 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-09 04:26:08,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,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, 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-09 04:26:08,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,820 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-09 04:26:08,821 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-09 04:26:08,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:08,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,861 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-09 04:26:08,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:08,866 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-09 04:26:08,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:08,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:08,886 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-09 04:26:08,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:82 [2018-12-09 04:26:09,720 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-09 04:26:09,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:09,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:09,727 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-09 04:26:09,740 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-09 04:26:09,742 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-09 04:26:09,824 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-09 04:26:09,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:09,835 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-09 04:26:09,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 04:26:09,843 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-09 04:26:09,843 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 04:26:09,855 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-09 04:26:09,856 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 04:26:09,939 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-09 04:26:09,997 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-09 04:26:10,009 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-09 04:26:10,010 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,024 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,028 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-09 04:26:10,040 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-09 04:26:10,040 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,056 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,060 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-09 04:26:10,071 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-09 04:26:10,072 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,087 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,091 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-09 04:26:10,103 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-09 04:26:10,103 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,119 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:26:10,213 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-09 04:26:10,213 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:117, output treesize:343 [2018-12-09 04:26:11,388 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-09 04:26:11,389 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-09 04:26:11,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,415 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-09 04:26:11,417 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-09 04:26:11,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,441 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-09 04:26:11,442 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-09 04:26:11,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:11,457 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-09 04:26:11,457 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:152, output treesize:11 [2018-12-09 04:26:11,569 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-09 04:26:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:26:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 65 [2018-12-09 04:26:11,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-09 04:26:11,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-09 04:26:11,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3830, Unknown=2, NotChecked=250, Total=4290 [2018-12-09 04:26:11,585 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 66 states. [2018-12-09 04:26:14,150 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2018-12-09 04:26:16,570 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-12-09 04:26:17,412 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-09 04:26:17,925 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-09 04:26:18,299 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-09 04:26:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:26:19,062 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-09 04:26:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-09 04:26:19,063 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-12-09 04:26:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:26:19,063 INFO L225 Difference]: With dead ends: 119 [2018-12-09 04:26:19,063 INFO L226 Difference]: Without dead ends: 119 [2018-12-09 04:26:19,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=567, Invalid=7810, Unknown=3, NotChecked=362, Total=8742 [2018-12-09 04:26:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-09 04:26:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-12-09 04:26:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 04:26:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-12-09 04:26:19,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 94 [2018-12-09 04:26:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:26:19,066 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-12-09 04:26:19,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-09 04:26:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-12-09 04:26:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 04:26:19,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:26:19,067 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-09 04:26:19,067 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:26:19,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:26:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2024056639, now seen corresponding path program 1 times [2018-12-09 04:26:19,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:26:19,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:26:19,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:19,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:19,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:26:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:19,493 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-09 04:26:19,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:26:19,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:26:19,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:26:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:26:19,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:26:19,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:19,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:19,573 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-09 04:26:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-09 04:26:19,603 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-09 04:26:19,604 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-09 04:26:19,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 04:26:19,635 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-09 04:26:19,636 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-09 04:26:19,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,643 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-09 04:26:19,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-09 04:26:19,699 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-09 04:26:19,702 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-09 04:26:19,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,711 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-09 04:26:19,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-12-09 04:26:19,747 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-09 04:26:19,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:19,750 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-09 04:26:19,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:19,759 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-09 04:26:19,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-09 04:26:20,379 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-09 04:26:20,386 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-09 04:26:20,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:20,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:20,390 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-09 04:26:20,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:26:20,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:26:20,400 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-09 04:26:20,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-12-09 04:26:21,034 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-09 04:26:21,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:26:21,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:26:21,042 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-09 04:26:21,050 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-09 04:26:21,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:26:21,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:26:21,069 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-09 04:26:21,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-12-09 04:26:33,567 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-09 04:26:33,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:26:33,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2018-12-09 04:26:33,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 04:26:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 04:26:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2488, Unknown=2, NotChecked=202, Total=2862 [2018-12-09 04:26:33,583 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 54 states. [2018-12-09 04:26:55,376 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-12-09 04:27:03,714 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-12-09 04:27:06,266 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-09 04:27:06,420 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-09 04:27:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:27:06,587 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-09 04:27:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 04:27:06,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2018-12-09 04:27:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:27:06,588 INFO L225 Difference]: With dead ends: 112 [2018-12-09 04:27:06,588 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 04:27:06,588 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-09 04:27:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 04:27:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-09 04:27:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 04:27:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-12-09 04:27:06,590 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2018-12-09 04:27:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:27:06,590 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-12-09 04:27:06,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 04:27:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-12-09 04:27:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 04:27:06,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:27:06,590 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-09 04:27:06,591 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:27:06,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:27:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -603173294, now seen corresponding path program 1 times [2018-12-09 04:27:06,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:27:06,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:27:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:27:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:27:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:27:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:27:07,577 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-09 04:27:07,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:27:07,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:27:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:27:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:27:07,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:27:07,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:07,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 04:27:07,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-12-09 04:27:07,862 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-09 04:27:07,864 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-09 04:27:07,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,880 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-09 04:27:07,881 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-09 04:27:07,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 04:27:07,960 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-09 04:27:07,961 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-09 04:27:07,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,983 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-09 04:27:07,985 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-09 04:27:07,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:07,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 04:27:08,131 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-09 04:27:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,134 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-09 04:27:08,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,159 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-09 04:27:08,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,162 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-09 04:27:08,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:81 [2018-12-09 04:27:08,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,248 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-09 04:27:08,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,260 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-09 04:27:08,261 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-09 04:27:08,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,310 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-09 04:27:08,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,312 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-09 04:27:08,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:08,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:125 [2018-12-09 04:27:08,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,915 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-09 04:27:08,941 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-09 04:27:08,943 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-09 04:27:08,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:08,985 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-09 04:27:08,986 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-09 04:27:09,006 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-09 04:27:09,037 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-09 04:27:09,041 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-09 04:27:09,041 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:09,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,053 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-09 04:27:09,053 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:09,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:09,069 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-09 04:27:09,069 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-12-09 04:27:09,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,626 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-09 04:27:09,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,717 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-09 04:27:09,719 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-09 04:27:09,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:09,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,959 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-09 04:27:09,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:09,978 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-09 04:27:09,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,072 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-09 04:27:10,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:168, output treesize:138 [2018-12-09 04:27:10,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,322 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-09 04:27:10,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,369 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-09 04:27:10,373 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-09 04:27:10,506 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-09 04:27:10,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,540 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-09 04:27:10,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 04:27:10,576 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-09 04:27:10,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 04:27:10,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,587 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-09 04:27:10,588 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 04:27:10,667 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-09 04:27:10,702 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-09 04:27:10,703 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-09 04:27:10,703 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,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, 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-09 04:27:10,709 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,712 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,714 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-09 04:27:10,716 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-09 04:27:10,716 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,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-09 04:27:10,722 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,725 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,727 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-09 04:27:10,729 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-09 04:27:10,729 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,738 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-09 04:27:10,738 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,741 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,743 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-09 04:27:10,744 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-09 04:27:10,745 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,751 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-09 04:27:10,751 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,755 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:10,771 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-09 04:27:10,771 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-12-09 04:27:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,977 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-09 04:27:10,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:10,996 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-09 04:27:10,996 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-09 04:27:11,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:11,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:11,041 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-09 04:27:11,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:11,043 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-09 04:27:11,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:11,049 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-09 04:27:11,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:11,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:11,059 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-09 04:27:11,059 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:169, output treesize:80 [2018-12-09 04:27:13,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:13,163 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-09 04:27:13,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:13,174 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-09 04:27:13,174 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-09 04:27:13,188 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-09 04:27:13,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 04:27:13,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:27:13,205 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-09 04:27:13,205 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:35 [2018-12-09 04:27:13,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:13,516 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-09 04:27:13,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:13,529 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-09 04:27:13,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 04:27:13,844 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-09 04:27:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:27:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 70 [2018-12-09 04:27:13,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-09 04:27:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-09 04:27:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4608, Unknown=0, NotChecked=0, Total=4830 [2018-12-09 04:27:13,860 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 70 states. [2018-12-09 04:27:15,377 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-12-09 04:27:18,929 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-12-09 04:27:19,176 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-12-09 04:27:19,561 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-12-09 04:27:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:27:20,265 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-09 04:27:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 04:27:20,265 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 99 [2018-12-09 04:27:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:27:20,265 INFO L225 Difference]: With dead ends: 101 [2018-12-09 04:27:20,265 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 04:27:20,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=608, Invalid=8512, Unknown=0, NotChecked=0, Total=9120 [2018-12-09 04:27:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 04:27:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 04:27:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 04:27:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-09 04:27:20,267 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 99 [2018-12-09 04:27:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:27:20,268 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-09 04:27:20,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-09 04:27:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-09 04:27:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:27:20,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:27:20,269 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-09 04:27:20,269 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-09 04:27:20,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:27:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 616928174, now seen corresponding path program 1 times [2018-12-09 04:27:20,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:27:20,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:27:20,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:27:20,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:27:20,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:27:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:27:22,963 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-09 04:27:22,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:27:22,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/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-09 04:27:22,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:27:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:27:23,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:27:23,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:23,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:23,150 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-09 04:27:23,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-12-09 04:27:23,238 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-09 04:27:23,239 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-09 04:27:23,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 04:27:23,299 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-09 04:27:23,300 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-09 04:27:23,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,313 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-09 04:27:23,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-12-09 04:27:23,426 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-09 04:27:23,429 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-09 04:27:23,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,443 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-09 04:27:23,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-09 04:27:23,497 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-09 04:27:23,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:23,499 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-09 04:27:23,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,515 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-09 04:27:23,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-12-09 04:27:23,813 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-09 04:27:23,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,826 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-09 04:27:23,828 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-09 04:27:23,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:23,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:23,837 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-09 04:27:23,838 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-09 04:27:23,843 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-09 04:27:23,851 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-09 04:27:23,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-09 04:27:29,045 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 04:27:29,053 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-09 04:27:29,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:29,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:29,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:29,059 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-09 04:27:29,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:29,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:29,081 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-09 04:27:29,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:85 [2018-12-09 04:27:29,152 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-09 04:27:29,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:29,163 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-09 04:27:29,164 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-09 04:27:29,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:29,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:29,169 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-09 04:27:29,170 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-09 04:27:29,172 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-09 04:27:29,178 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-09 04:27:29,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-09 04:27:36,873 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 04:27:36,880 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-09 04:27:36,889 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-09 04:27:36,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:27:36,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:27:36,925 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-09 04:27:36,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-12-09 04:27:37,048 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-09 04:27:37,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:37,055 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-09 04:27:37,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-09 04:27:37,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, 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-09 04:27:37,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:37,211 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-09 04:27:37,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-09 04:27:37,533 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-09 04:27:37,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:37,543 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-09 04:27:37,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:37,548 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-09 04:27:37,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-12-09 04:27:39,909 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 04:27:55,862 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 04:27:57,866 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-09 04:27:57,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:57,873 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:27:57,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:57,874 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-09 04:27:57,876 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-09 04:27:57,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:57,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:27:57,906 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-09 04:27:57,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:57,909 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-09 04:27:57,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:27:57,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:27:57,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:57,926 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:27:57,927 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-09 04:27:57,927 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-09 04:27:57,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:27:57,944 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:27:57,945 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-09 04:27:57,945 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-09 04:27:57,955 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-09 04:27:57,972 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-09 04:27:57,973 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-12-09 04:27:58,096 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-09 04:27:58,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:27:58,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 68 [2018-12-09 04:27:58,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-09 04:27:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-09 04:27:58,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4300, Unknown=30, NotChecked=132, Total=4692 [2018-12-09 04:27:58,112 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 69 states. [2018-12-09 04:28:08,701 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 04:28:17,242 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 04:28:30,848 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-12-09 04:28:36,846 WARN L180 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-09 04:28:42,921 WARN L180 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2018-12-09 04:28:47,497 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-12-09 04:28:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:28:47,498 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-12-09 04:28:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 04:28:47,498 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 104 [2018-12-09 04:28:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:28:47,498 INFO L225 Difference]: With dead ends: 99 [2018-12-09 04:28:47,498 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 04:28:47,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 67.6s TimeCoverageRelationStatistics Valid=588, Invalid=8880, Unknown=42, NotChecked=192, Total=9702 [2018-12-09 04:28:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 04:28:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 04:28:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 04:28:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 04:28:47,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-12-09 04:28:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:28:47,499 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:28:47,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-09 04:28:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:28:47,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:28:47,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:28:47 BoogieIcfgContainer [2018-12-09 04:28:47,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:28:47,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:28:47,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:28:47,503 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:28:47,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:07" (3/4) ... [2018-12-09 04:28:47,506 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-09 04:28:47,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-12-09 04:28:47,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-09 04:28:47,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-09 04:28:47,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 04:28:47,554 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_11841e6c-7bc4-4878-8b5d-aa44f9a38f0e/bin-2019/uautomizer/witness.graphml [2018-12-09 04:28:47,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:28:47,554 INFO L168 Benchmark]: Toolchain (without parser) took 281056.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 951.7 MB in the beginning and 844.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 250.2 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: Boogie Preprocessor took 33.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: RCFGBuilder took 340.70 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.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: TraceAbstraction took 280342.00 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 851.3 MB in the end (delta: 179.9 MB). Peak memory consumption was 215.6 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,555 INFO L168 Benchmark]: Witness Printer took 51.40 ms. Allocated memory is still 1.2 GB. Free memory was 851.3 MB in the beginning and 844.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:28:47,556 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 340.70 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.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 280342.00 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 851.3 MB in the end (delta: 179.9 MB). Peak memory consumption was 215.6 MB. Max. memory is 11.5 GB. * Witness Printer took 51.40 ms. Allocated memory is still 1.2 GB. Free memory was 851.3 MB in the beginning and 844.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 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: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 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: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - 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, 280.3s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 174.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2923 SDtfs, 3134 SDslu, 16561 SDs, 0 SdLazy, 28587 SolverSat, 855 SolverUnsat, 94 SolverUnknown, 0 SolverNotchecked, 104.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2169 GetRequests, 1126 SyntacticMatches, 100 SemanticMatches, 943 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 12425 ImplicationChecksByTransitivity, 165.1s 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.2s SatisfiabilityAnalysisTime, 103.5s 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...